Sciweavers

8437 search results - page 193 / 1688
» Preferences over Sets
Sort
View
ECAI
2010
Springer
15 years 7 months ago
Strengthening Landmark Heuristics via Hitting Sets
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
Blai Bonet, Malte Helmert
IJAR
2008
117views more  IJAR 2008»
15 years 6 months ago
New geometric inference techniques for type-2 fuzzy sets
This paper presents new techniques for performing logical operations on type-2 fuzzy sets. These techniques make significant use of geometric methods to give, for the first time, ...
Simon Coupland, Robert John
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
14 years 6 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
CVPR
2006
IEEE
16 years 8 months ago
The Panum Proxy Algorithm for Dense Stereo Matching over a Volume of Interest
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
Ankur Agarwal, Andrew Blake
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
16 years 7 months ago
Robust Runtime Optimization of Data Transfer in Queries over Web Services
Self-managing solutions have recently attracted a lot of interest from the database community. The need for self-* properties is more evident in distributed applications comprising...
Anastasios Gounaris, Christos Yfoulis, Rizos Sakel...