Sciweavers

92 search results - page 11 / 19
» Making the Breakout Algorithm Complete Using Systematic Sear...
Sort
View
KAIS
2008
114views more  KAIS 2008»
14 years 9 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
JAIR
2008
103views more  JAIR 2008»
14 years 9 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
TIP
1998
240views more  TIP 1998»
14 years 9 months ago
DCT-based motion estimation
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
Ut-Va Koc, K. J. Ray Liu
ICDE
2008
IEEE
2751views Database» more  ICDE 2008»
16 years 9 months ago
Skyline Query Processing for Incomplete Data
Recently, there has been much interest in processing skyline queries for various applications that include decision making, personalized services, and search pruning. Skyline queri...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
85
Voted
ICDCS
2005
IEEE
15 years 3 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer