Sciweavers

7379 search results - page 65 / 1476
» How Many Clusters
Sort
View
93
Voted
ICALP
2005
Springer
15 years 6 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
100
Voted
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 6 months ago
The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
Roberto J. Bayardo
82
Voted
SEMWEB
2004
Springer
15 years 6 months ago
How to Build Google2Google - An (Incomplete) Recipe
Abstract. This talk explores aspects relevant for peer-to-peer search infrastructures, which we think are better suited to semantic web search than centralized approaches. It does ...
Wolfgang Nejdl
94
Voted
ASIACRYPT
1999
Springer
15 years 5 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
SIGIR
1998
ACM
15 years 5 months ago
How Reliable Are the Results of Large-Scale Information Retrieval Experiments?
Two stages in measurement of techniques for information retrieval are gathering of documents for relevance assessment and use of the assessments to numerically evaluate effective...
Justin Zobel