Sciweavers

61 search results - page 10 / 13
» soda 2001
Sort
View
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
14 years 7 days ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
14 years 7 days ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
14 years 7 days ago
A linear lower bound on index size for text retrieval
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
Erik D. Demaine, Alejandro López-Ortiz
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
14 years 7 days ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
14 years 7 days ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...