1012 search results - page 44 / 203 » Segment intersection searching problems in general settings |
117
click to vote
MM
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
102
click to vote
CP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
103
click to vote
NIPS
1996
15 years 1 months ago
1996
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
119
click to vote
CIVR
2010
Springer
15 years 3 months ago
2010
Springer
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
107
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...