Sciweavers

3257 search results - page 267 / 652
» Some Results on Effective Randomness
Sort
View
COMBINATORICS
2000
84views more  COMBINATORICS 2000»
14 years 11 months ago
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
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...
Charles Knessl, Wojciech Szpankowski
SUM
2010
Springer
14 years 9 months ago
A Formal Analysis of Logic-Based Argumentation Systems
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 ...
Leila Amgoud, Philippe Besnard
ITIIS
2010
158views more  ITIIS 2010»
14 years 5 months ago
Development of a Dynamic Collision Avoidance Algorithm for Indoor Tracking System Based on Active RFID
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...
Sekyung Han, Yeonsuk Choi, Masayuki Iwai, Kaoru Se...
CSMR
2000
IEEE
15 years 3 months ago
Experiences Reverse Engineering Manually
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...
Dave Swafford, Diana Elman, Peter Aiken, Jeff Merh...
ICCV
1999
IEEE
16 years 29 days ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg