5675 search results - page 880 / 1135 » Exploiting Chaos for Computation |
235
click to vote
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categoriza...
186
click to vote
DEXA
2006
Springer
15 years 9 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...
140
click to vote
KDD
2010
ACM
15 years 9 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...
190
click to vote
CIMCA
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper describes a portlet-based portal that provides user interfaces for access a Grid-based elearning platform. E-learning platforms that exploit resources and computing pow...
189
click to vote
CPAIOR
2008
Springer
15 years 9 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...