Sciweavers

5316 search results - page 264 / 1064
» Which Search Problems Are Random
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 5 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
ICML
2005
IEEE
16 years 5 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ICDM
2006
IEEE
129views Data Mining» more  ICDM 2006»
15 years 11 months ago
Keyword Generation for Search Engine Advertising
Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobviou...
Amruta Joshi, Rajeev Motwani
CPM
2001
Springer
98views Combinatorics» more  CPM 2001»
15 years 9 months ago
Regular Expression Searching over Ziv-Lempel Compressed Text
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
Gonzalo Navarro
118
Voted
EVOW
2008
Springer
15 years 6 months ago
Enhancing Parameter Estimation of Biochemical Networks by Exponentially Scaled Search Steps
A fundamental problem of modelling in Systems Biology is to precisely characterise quantitative parameters, which are hard to measure experimentally. For this reason, it is common ...
Hendrik Rohn, Bashar Ibrahim, Thorsten Lenser, Tho...