Sciweavers

834 search results - page 96 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
ICCV
1999
IEEE
15 years 4 months ago
Geodesic Active Regions for Supervised Texture Segmentation
This paper presents a novel variational method for supervised texture segmentation. The textured feature space is generated by filtering the given textured images using isotropic ...
Nikos Paragios, Rachid Deriche
AAAI
2011
13 years 12 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
GPC
2007
Springer
15 years 6 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
93
Voted
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
15 years 11 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
89
Voted
ICCV
2007
IEEE
16 years 1 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára