Sciweavers

279 search results - page 36 / 56
» Constructive Interval Disjunction
Sort
View
JGT
2007
81views more  JGT 2007»
15 years 1 months ago
Pathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
David Coudert, Florian Huc, Jean-Sébastien ...
SCN
2010
Springer
163views Communications» more  SCN 2010»
14 years 11 months ago
Time-Specific Encryption
This paper introduces and explores the new concept of Time-Specific Encryption (TSE). In (Plain) TSE, a Time Server broadcasts a key at the beginning of each time unit, a Time Inst...
Kenneth G. Paterson, Elizabeth A. Quaglia
147
Voted
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 1 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
102
Voted
WSDM
2010
ACM
173views Data Mining» more  WSDM 2010»
15 years 11 months ago
Measuring the Reusability of Test Collections
While test collection construction is a time-consuming and expensive process, the true cost is amortized by reusing the collection over hundreds or thousands of experiments. Some ...
Ben Carterette, Evgeniy Gabrilovich, Vanja Josifov...
TCC
2004
Springer
105views Cryptology» more  TCC 2004»
15 years 7 months ago
Unfair Noisy Channels and Oblivious Transfer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
Ivan Damgård, Serge Fehr, Kirill Morozov, Lo...