Sciweavers

5153 search results - page 592 / 1031
» Introduction to Randomized Algorithms
Sort
View
COCOON
2001
Springer
15 years 11 months ago
On-Line Variable Sized Covering
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
Leah Epstein
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 10 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
IJCNN
2000
IEEE
15 years 10 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
STOC
1998
ACM
121views Algorithms» more  STOC 1998»
15 years 10 months ago
Non-Interactive and Non-Malleable Commitment
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovs...
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
15 years 10 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum