Sciweavers

1047 search results - page 82 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 9 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
CVPR
2005
IEEE
14 years 10 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell
HPDC
2010
IEEE
13 years 9 months ago
Reshaping text data for efficient processing on Amazon EC2
Text analysis tools are nowadays required to process increasingly large corpora which are often organized as small files (abstracts, news articles, etc). Cloud computing offers a ...
Gabriela Turcu, Ian T. Foster, Svetlozar Nestorov
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 8 months ago
Sponsored Search Auctions with Markovian Users
Abstract. Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auct...
Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Mar...
FROCOS
2009
Springer
13 years 11 months ago
Efficient Combination of Decision Procedures for MUS Computation
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
Cédric Piette, Youssef Hamadi, Lakhdar Sais