1431 search results - page 106 / 287 » The complexity of random ordered structures |
126
click to vote
DAM
2011
14 years 10 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
151
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
130
click to vote
ISSTA
2004
ACM
15 years 8 months ago
2004
ACM
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
152
click to vote
AIPS
2009
15 years 4 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
161
click to vote
FGR
2011
IEEE
14 years 6 months ago
2011
IEEE
— Non-rigid object detection is a challenging open research problem in computer vision. It is a critical part in many applications such as image search, surveillance, humancomput...