Sciweavers

297 search results - page 27 / 60
» On the Fastest Vickrey Algorithm
Sort
View
ACSC
2004
IEEE
13 years 11 months ago
In-Place versus Re-Build versus Re-Merge: Index Maintenance Strategies for Text Retrieval Systems
Indexes are the key technology underpinning efficient text search. A range of algorithms have been developed for fast query evaluation and for index creation, but update algorithm...
Nicholas Lester, Justin Zobel, Hugh E. Williams
DASFAA
2010
IEEE
127views Database» more  DASFAA 2010»
13 years 7 months ago
PGP-mc: Towards a Multicore Parallel Approach for Mining Gradual Patterns
Gradual patterns highlight complex order correlations of the form “The more/less X, the more/less Y”. Only recently algorithms have appeared to mine efficiently gradual rules. ...
Anne Laurent, Benjamin Négrevergne, Nicolas...
DAM
1999
99views more  DAM 1999»
13 years 7 months ago
Recognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
Wilfried Imrich, Sandi Klavzar
WWW
2009
ACM
14 years 8 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 29 days ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang