Sciweavers

2252 search results - page 294 / 451
» Improving Random Forests
Sort
View
JAIR
2011
129views more  JAIR 2011»
14 years 7 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek
JSS
2010
198views more  JSS 2010»
14 years 7 months ago
Accelerated collection of sensor data by mobility-enabled topology ranks
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Mot...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
107
Voted
IACR
2011
136views more  IACR 2011»
14 years 11 days ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
DAC
2003
ACM
16 years 1 months ago
The synthesis of cyclic combinational circuits
Combinational circuits are generally thought of as acyclic structures. It is known that cyclic structures can be combinational, and techniques have been proposed to analyze cyclic...
Marc D. Riedel, Jehoshua Bruck
98
Voted
PODC
2009
ACM
16 years 1 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer