Sciweavers

15485 search results - page 252 / 3097
» Computing Optimal Subsets
Sort
View
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
16 years 6 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
16 years 3 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
16 years 1 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...
CIKM
2009
Springer
16 years 1 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
CIE
2007
Springer
16 years 23 days ago
Strict Self-assembly of Discrete Sierpinski Triangles
Winfree (1998) showed that discrete Sierpinski triangles can self-assemble in the Tile Assembly Model. A striking molecular realization of this self-assembly, using DNA tiles a fe...
James I. Lathrop, Jack H. Lutz, Scott M. Summers