FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
DSN
2006
IEEE
14 years 5 months ago
2006
IEEE
We present three algorithms for detecting the need for software rejuvenation by monitoring the changing values of a customer-affecting performance metric, such as response time. A...
CCECE
2006
IEEE
14 years 5 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
3DPVT
2006
IEEE
14 years 5 months ago
2006
IEEE
3D city modeling using computer vision is very challenging. A typical city contains objects which are a nightmare for some vision algorithms, while other algorithms have been desi...
3DPVT
2006
IEEE
14 years 5 months ago
2006
IEEE
We recently proposed a new and efficient next-bestview algorithm for 3D reconstruction of indoor scenes using active range sensing. We overcome the computation difficulty of evalu...
WEA
2007
Springer
14 years 5 months ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
WEA
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
WEA
2007
Springer
14 years 5 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
WEA
2007
Springer
14 years 5 months ago
2007
Springer
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
WEA
2007
Springer
14 years 5 months ago
2007
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...