Sciweavers

1512 search results - page 216 / 303
» When Suboptimal Rules
Sort
View
142
Voted
ICML
2000
IEEE
16 years 1 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
115
Voted
WWW
2008
ACM
16 years 1 months ago
Application of bitmap index to information retrieval
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
WWW
2004
ACM
16 years 1 months ago
Composite events for xml
Recently, active behavior has received attention in the XML field to automatically react to occurred events. Aside from proprietary approaches for enriching XML with active behavi...
Martin Bernauer, Gerti Kappel, Gerhard Kramler
99
Voted
CAV
2009
Springer
157views Hardware» more  CAV 2009»
16 years 1 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
94
Voted
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
16 years 1 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff