Sciweavers

6365 search results - page 392 / 1273
» Fast Local Computation Algorithms
Sort
View
IJAC
2008
84views more  IJAC 2008»
15 years 6 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
ICML
2005
IEEE
16 years 7 months ago
Identifying useful subgoals in reinforcement learning by local graph partitioning
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
Özgür Simsek, Alicia P. Wolfe, Andrew G....
ICPR
2000
IEEE
15 years 11 months ago
Face Detection Based on Generic Local Descriptors and Spatial Constraints
In this paper we present an algorithm for face detection that is based on generic local descriptors (e.g. eyes). A generic descriptor captures the distribution of individual descr...
Veronika Vogelhuber, Cordelia Schmid
ANCS
2006
ACM
16 years 24 days ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
CGF
2005
95views more  CGF 2005»
15 years 6 months ago
Fast Summed-Area Table Generation and its Applications
We introduce a technique to rapidly generate summed-area tables using graphics hardware. Summed area tables, originally introduced by Crow, provide a way to filter arbitrarily lar...
Justin Hensley, Thorsten Scheuermann, Greg Coombe,...