Sciweavers

416 search results - page 39 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 7 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
SOFSEM
2010
Springer
13 years 5 months ago
Approximate Structural Consistency
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
Michel de Rougemont, Adrien Vieilleribière
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei
WWW
2009
ACM
14 years 8 months ago
Efficient interactive fuzzy keyword search
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
Shengyue Ji, Guoliang Li, Chen Li, Jianhua Feng