1431 search results - page 173 / 287 » The complexity of random ordered structures |
124
Voted
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
123
Voted
RAID
1999
Springer
15 years 7 months ago
1999
Springer
Distributed intrusion detection systems are especially vulnerable to attacks because the components reside at a static location and are connected together into a hierarchical stru...
157
Voted
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
125
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
140
click to vote
FLAIRS
2008
15 years 5 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...