10414 search results - page 1605 / 2083 » An efficient algorithm for Co-segmentation |
185
click to vote
TIT
2008
15 years 6 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
209
click to vote
TSP
2008
15 years 6 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
222
click to vote
JWSR
2007
15 years 6 months ago
2007
: Dynamic Web data sources – sometimes known collectively as the Deep Web – increase the utility of the Web by providing intuitive access to data repositories anywhere that Web...
257
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
225
click to vote
KAIS
2002
15 years 6 months ago
2002
A great challenge for web site designers is how to ensure users' easy access to important web pages efficiently. In this paper we present a clustering-based approach to addres...