921 search results - page 77 / 185 » New Data Structures for Orthogonal Range Searching |
130
click to vote
ECCV
2000
Springer
16 years 6 months ago
2000
Springer
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
139
click to vote
WACV
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
112
click to vote
NAR
2010
14 years 11 months ago
2010
As the amount of biological data grows, so does the need for biologists to store and access this information in central repositories in a free and unambiguous manner. The European...
133
click to vote
PAKDD
2007
ACM
15 years 10 months ago
2007
ACM
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
147
Voted
BMCBI
2006
15 years 4 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...