Sciweavers

4266 search results - page 212 / 854
» The container loading problem
Sort
View
CVPR
2008
IEEE
16 years 6 months ago
Summarizing visual data using bidirectional similarity
We propose a principled approach to summarization of visual data (images or video) based on optimization of a well-defined similarity measure. The problem we consider is re-target...
Denis Simakov, Yaron Caspi, Eli Shechtman, Michal ...
ICDCS
2009
IEEE
16 years 1 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
15 years 5 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
IPL
2007
96views more  IPL 2007»
15 years 4 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...
CORR
2008
Springer
117views Education» more  CORR 2008»
15 years 2 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan