1431 search results - page 129 / 287 » The complexity of random ordered structures |
149
click to vote
COGSCI
2004
15 years 6 months ago
2004
In order to understand ongoing activity, observers segment it into meaningful temporal parts. Segmentation can be based on bottom-up processing of distinctive sensory characterist...
240
click to vote
ICTAI
2003
IEEE
15 years 11 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
160
click to vote
AAAI
2007
15 years 8 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
173
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
173
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...