Sciweavers

1327 search results - page 258 / 266
» Path following algorithm for the graph matching problem
Sort
View
SPAA
2006
ACM
15 years 3 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
CGO
2008
IEEE
14 years 11 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
115
Voted
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 6 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
IROS
2006
IEEE
159views Robotics» more  IROS 2006»
15 years 3 months ago
Multi-Level Surface Maps for Outdoor Terrain Mapping and Loop Closing
— To operate outdoors or on non-flat surfaces, mobile robots need appropriate data structures that provide a compact representation of the environment and at the same time suppo...
Rudolph Triebel, Patrick Pfaff, Wolfram Burgard