217 search results - page 29 / 44 » On the Fine Structure of Large Search Spaces |
BTW
2009
Springer
15 years 3 months ago
2009
Springer
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
124
click to vote
AIRWEB
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we study the overall link-based spam structure and its evolution which would be helpful for the development of robust analysis tools and research for Web spamming a...
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
111
click to vote
ISDA
2010
IEEE
14 years 9 months ago
2010
IEEE
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...