20441 search results - page 3667 / 4089 » Locally Computable Structures |
134
click to vote
SCIA
2007
Springer
15 years 11 months ago
2007
Springer
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
139
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
This paper reports our first set of results on managing uncertainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do...
181
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
115
Voted
WABI
2007
Springer
15 years 11 months ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
135
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...