Sciweavers

2252 search results - page 169 / 451
» Improving Random Forests
Sort
View
DEXA
2009
Springer
138views Database» more  DEXA 2009»
14 years 2 months ago
Evaluating Non-In-Place Update Techniques for Flash-Based Transaction Processing Systems
Recently, flash memory is emerging as the storage device. With price sliding fast, the cost per capacity is approaching to that of SATA disk drives. So far flash memory has been ...
Yongkun Wang, Kazuo Goda, Masaru Kitsuregawa
EUROCRYPT
2007
Springer
14 years 2 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
CP
2000
Springer
14 years 20 days ago
Singleton Consistencies
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
Patrick Prosser, Kostas Stergiou, Toby Walsh
EDBT
2010
ACM
132views Database» more  EDBT 2010»
13 years 11 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
AAAI
2008
13 years 10 months ago
Lifted Probabilistic Inference with Counting Formulas
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
Brian Milch, Luke S. Zettlemoyer, Kristian Kerstin...