Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2007
0/1 vertex and facet enumeration with BDDs
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 158–165In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Another one is the convex hull problem: Given a set of 0/1 points in dimension ...
- research-articleJanuary 2007
Locating guards for visibility coverage of polygons
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 120–134We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the "art gallery problem", is known to be NP-hard, so most recent research has focused on heuristics and approximation ...
- research-articleJanuary 2007
Maximizing throughput in minimum rounds in an application-level relay service
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 109–119Application-level network relays possess many desirable properties, including support for communication between disconnected clients, increasing bandwidth between distant clients, and enabling routing around Internet failures. One problem not considered ...
- research-articleJanuary 2007
Linearization: locally self-stabilizing sorting in graphs
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 99–108We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This algorithm should be as simple as possible and, for scalability, should ...
- research-articleJanuary 2007
Algorithms to take advantage of hardware prefetching
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 91–98Cache-oblivious and cache-aware algorithms have been developed to minimize cache misses. Some of the newest processors have hardware prefetching where cache misses are avoided by predicting ahead of time what memory will be needed in the future and ...
- research-articleJanuary 2007
Faster filters for approximate string matching
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 84–90We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor filters, and which are among the best practical algorithms for approximate ...
- research-articleJanuary 2007
Intersection in integer inverted indices
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 71–83Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might have vastly varying lengths. We compare previous theoretical approaches, ...
- research-articleJanuary 2007
Practical entropy-compressed rank/select dictionary
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 60–70Rank/Select dictionaries are data structures for an ordered set S ⊂ {0,1, . . ., n − 1} to compute rank(x, S) (the number of elements in S that are no greater than x), and select(i, S) (the i-th smallest element in S), which are the fundamental ...
- research-articleJanuary 2007
Computing visibility on terrains in external memory
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 13–22We describe a novel application of the distribution sweeping technique to computing visibility on terrains. Given an arbitrary viewpoint v, the basic problem we address is computing the visibility map or viewshed of v, which is the set of points in the ...
- research-articleJanuary 2007
Improved external memory BFS implementations
Proceedings of the Meeting on Algorithm Engineering & ExpermimentsJanuary 2007, Pages 3–12Breadth first search (BFS) traversal on massive graphs in external memory was considered non-viable until recently, because of the large number of I/Os it incurs. Ajwani et al. [3] showed that the randomized variant of the o(n) I/O algorithm of Mehlhorn ...