Sciweavers

19866 search results - page 229 / 3974
» Computing all factorizations in ***
Sort
View
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
15 years 12 months ago
Autonomous feature-based exploration
: The performance of single-camera SLAM is improved when wide-angle optics provide a field of view greater than the 40 to 50 degrees lenses normally used in computer vision. The is...
Paul M. Newman, Michael Bosse, John J. Leonard
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 10 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
176
Voted
COR
2007
108views more  COR 2007»
15 years 6 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
MST
2010
86views more  MST 2010»
15 years 1 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
ICALP
2009
Springer
16 years 1 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald