Sciweavers

27 search results - page 5 / 6
» A combinatorial approach to the analysis of bucket recursive...
Sort
View
GIS
2006
ACM
13 years 5 months ago
Swarming methods for geospatial reasoning
Geospatial data is often used to predict or recommend movements of robots, people, or animals ("walkers"). Analysis of such systems can be combinatorially explosive. Eac...
H. Van Dyke Parunak, Sven Brueckner, Robert S. Mat...
FOCS
1997
IEEE
13 years 9 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
CGF
2002
135views more  CGF 2002»
13 years 5 months ago
Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
Valerio Pascucci
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 5 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
13 years 9 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger