5595 search results - page 797 / 1119 » Approximation Algorithms for Clustering Problems |
183
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a system that can match and reconstruct 3D
scenes from extremely large collections of photographs such
as those found by searching for a given city (e.g., Rome) on
In...
195
click to vote
IV
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
203
click to vote
SPAA
2004
ACM
16 years 4 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
166
click to vote
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
174
Voted
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider a variation of the problem of combining expert opinions for the situation in which there is no ground truth to use for training. Even though we don’t have labeled da...