4843 search results - page 817 / 969 » The Shortcut Problem - Complexity and Approximation |
133
Voted
ICOIN
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, start...
129
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
105
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
142
Voted
MIRAGE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
109
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...