Sciweavers

252 search results - page 13 / 51
» Transforming set data types to power optimal data structures
Sort
View
APLAS
2009
ACM
14 years 3 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 8 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
PAMI
2010
180views more  PAMI 2010»
13 years 3 months ago
Point Set Registration via Particle Filtering and Stochastic Dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
ENTCS
2007
174views more  ENTCS 2007»
13 years 8 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 5 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...