Sciweavers

1007 search results - page 88 / 202
» The Complexity of Futile Questioning
Sort
View
ICML
2008
IEEE
16 years 2 months ago
Detecting statistical interactions with additive groves of trees
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
Daria Sorokina, Rich Caruana, Mirek Riedewald, Dan...
ICML
2008
IEEE
16 years 2 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
WWW
2008
ACM
16 years 1 months ago
Size matters: word count as a measure of quality on wikipedia
Wikipedia, "the free encyclopedia", now contains over two million English articles, and is widely regarded as a highquality, authoritative encyclopedia. Some Wikipedia a...
Joshua E. Blumenstock
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
16 years 1 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
CHI
2004
ACM
16 years 1 months ago
Passwords you'll never forget, but can't recall
We identify a wide range of human memory phenomena as potential certificates of identity. These "imprinting" behaviors are characterized by vast capacity for complex exp...
Daphna Weinshall, Scott Kirkpatrick