Sciweavers

3223 search results - page 283 / 645
» The Scaling of Search Cost
Sort
View
193
Voted
IROS
2006
IEEE
144views Robotics» more  IROS 2006»
16 years 1 months ago
Estimating Probability Distribution with Q-learning for Biped Gait Generation and Optimization
— A new biped gait generation and optimization method is proposed in the frame of Estimation of Distribution Algorithms (EDAs) with Q-learning method. By formulating the biped ga...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
16 years 1 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
196
Voted
MIR
2004
ACM
110views Multimedia» more  MIR 2004»
16 years 28 days ago
Symbolic representation and retrieval of moving object trajectories
Searching moving object trajectories of video databases has been applied to many fields, such as video data analysis, content-based video retrieval, video scene classification. ...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 11 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
ASPDAC
2008
ACM
124views Hardware» more  ASPDAC 2008»
15 years 9 months ago
MaizeRouter: Engineering an effective global router
In this paper, we present the complete design and architectural details of MAIZEROUTER. MAIZEROUTER reflects a significant leap in progress over existing publicly available routing...
Michael D. Moffitt