Sciweavers

10414 search results - page 1798 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
CISSE
2008
Springer
15 years 5 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier
155
Voted
CIVR
2008
Springer
204views Image Analysis» more  CIVR 2008»
15 years 5 months ago
Image clustering based on a shared nearest neighbors approach for tagged collections
Browsing and finding pictures in large-scale and heterogeneous collections is an important issue, most particularly for online photo sharing applications. Since such services know...
Pierre-Alain Moëllic, Jean-Emmanuel Haugeard,...
CONCUR
2008
Springer
15 years 5 months ago
Subsequence Invariants
We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which re...
Klaus Dräger, Bernd Finkbeiner
CONEXT
2008
ACM
15 years 5 months ago
MINT: a Market for INternet Transit
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
Vytautas Valancius, Nick Feamster, Ramesh Johari, ...
CP
2008
Springer
15 years 5 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
« Prev « First page 1798 / 2083 Last » Next »