Sciweavers

1252 search results - page 73 / 251
» Foundations of Similarity and Utility
Sort
View
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
13 years 12 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
IJCAI
1993
13 years 9 months ago
Provably Bounded Optimal Agents
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
FGR
2008
IEEE
134views Biometrics» more  FGR 2008»
14 years 2 months ago
HMM parameter reduction for practical gesture recognition
We examine in detail some properties of gesture recognition models which utilize a reduced number of parameters and lower algorithmic complexity compared to traditional hidden Mar...
Stjepan Rajko, Gang Qian
BIBE
2007
IEEE
150views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
Differential Scoring for Systolic Sequence Alignment
Systolic implementations of dynamic programming solutions that utilize a similarity matrix can achieve appreciable performance with both course- and fine-grain parallelization. A ...
Antonio E. de la Serna