Sciweavers

7129 search results - page 1051 / 1426
» Approximation Algorithms for Treewidth
Sort
View
COCOON
2005
Springer
15 years 9 months ago
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
Xiang-Yang Li, Peng-Jun Wan
EMMCVPR
2005
Springer
15 years 9 months ago
Stereo for Slanted Surfaces: First Order Disparities and Normal Consistency
Traditional stereo algorithms either explicitly use the frontal parallel plane assumption by only considering position (zero-order) disparity when computing similarity measures of ...
Gang Li, Steven W. Zucker
MFCS
2005
Springer
15 years 9 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
146
Voted
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 9 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
129
Voted
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 9 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
« Prev « First page 1051 / 1426 Last » Next »