2479 search results - page 199 / 496 » Random Event Structures |
167
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
176
Voted
SLS
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
166
click to vote
SPIN
2009
Springer
16 years 1 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
199
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
161
click to vote
ENGL
2008
15 years 6 months ago
2008
This paper proposes the LQ-Servo controller for AQM (Active Queue Management) routers. The proposed controller structure is made by taking a traditional servo mechanism based on Li...