Sciweavers

3172 search results - page 39 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
GBRPR
2005
Springer
15 years 6 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
106
Voted
FOIKS
2004
Springer
15 years 6 months ago
Implementing Ordered Choice Logic Programming using Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
Marina De Vos
SAC
2009
ACM
15 years 5 months ago
Incremental board: a grid-based space for visualizing dynamic data sets
In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We introduce a chess board analogy for displaying (projecting) obj...
Roberto Pinho, Maria Cristina Ferreira de Oliveira...
95
Voted
PRL
2002
67views more  PRL 2002»
15 years 9 days ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 7 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin