2107 search results - page 190 / 422 » Computing Small Search Numbers in Linear Time |
161
click to vote
TKDE
2008
15 years 3 months ago
2008
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
153
click to vote
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
117
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
125
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
132
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
Abstract -- This paper describes a new memory estimation technique for DSP applications written in an applicative language. Since no concept of storage is present in an applicative...