3068 search results - page 260 / 614 » Clustering with Multiple Graphs |
156
click to vote
TCC
2007
Springer
15 years 11 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
174
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
We propose a framework for detecting and tracking multiple interacting objects, while explicitly handling the dual problems of fragmentation (an object may be broken into several ...
190
click to vote
ICTAI
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
164
Voted
WWW
2010
ACM
16 years 17 days ago
2010
ACM
With the explosive growth of digital cameras and online media, it has become crucial to design efficient methods that help users browse and search large image collections. The rec...
154
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...