Sciweavers

1573 search results - page 191 / 315
» A Data Structure for Sponsored Search
Sort
View
MSV
2004
15 years 8 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
ENTCS
2008
116views more  ENTCS 2008»
15 years 6 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
LRE
2007
87views more  LRE 2007»
15 years 6 months ago
Unleashing the killer corpus: experiences in creating the multi-everything AMI Meeting Corpus
The AMI Meeting Corpus contains 100 hours of meetings captured using many synchronized recording devices, and is designed to support work in speech and video processing, language ...
Jean Carletta
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 5 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
KDD
2005
ACM
194views Data Mining» more  KDD 2005»
16 years 7 months ago
Web object indexing using domain knowledge
Web object is defined to represent any meaningful object embedded in web pages (e.g. images, music) or pointed to by hyperlinks (e.g. downloadable files). Users usually search for...
Muyuan Wang, Zhiwei Li, Lie Lu, Wei-Ying Ma, Naiya...