3257 search results - page 267 / 652 » Some Results on Effective Randomness |
166
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
172
click to vote
SUM
2010
Springer
15 years 4 months ago
2010
Springer
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
186
click to vote
ITIIS
2010
15 years 1 months ago
2010
We propose a novel collision-avoidance algorithm for the active type RFID regarding an indoor tracking system. Several well-known collision avoidance algorithms are analyzed consi...
177
click to vote
CSMR
2000
IEEE
15 years 11 months ago
2000
IEEE
Better understanding manual reverse engineering can make it and any associated systems reengineering more effective. We reverse engineered a version of a system (referred to as &q...
176
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...