3894 search results - page 625 / 779 » Approximation Algorithms for Biclustering Problems |
115
click to vote
MLG
2007
Springer
15 years 9 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
142
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
222
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
120
Voted
MSWIM
2005
ACM
15 years 9 months ago
2005
ACM
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...