4886 search results - page 666 / 978 » Approximate Data Exchange |
173
click to vote
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
128
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
161
Voted
BNCOD
2007
15 years 8 months ago
2007
We present a novel framework for indexing and searching schema-less XML documents based on concise summaries of their structural and textual content. Our search query language is X...
177
click to vote
NIPS
2007
15 years 8 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
184
click to vote
RIAO
2007
15 years 8 months ago
2007
According to some current thinking, a very large number of semantic concepts could provide researcher a novel way to characterize video and be utilized for video retrieval and und...