Sciweavers

3875 search results - page 696 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ECML
2007
Springer
15 years 4 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
ICOIN
2007
Springer
15 years 3 months ago
Balanced Multipath Source Routing
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...
Shreyas Prasad, André Schumacher, Harri Haa...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Fast Evaluation of Union-Intersection Expressions
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 ...
Philip Bille, Anna Pagh, Rasmus Pagh
VLDB
2007
ACM
105views Database» more  VLDB 2007»
15 years 3 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
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...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
CRV
2006
IEEE
69views Robotics» more  CRV 2006»
15 years 3 months ago
Photometric Stereo with Nearby Planar Distributed Illuminants
This paper considers the problem of shape-from-shading using nearby planar distributed illuminants. It is shown that a rectangular planar nearby distributed uniform isotropic illu...
James J. Clark