Sciweavers

2370 search results - page 430 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
PRL
2008
78views more  PRL 2008»
14 years 9 months ago
Retrieving scale from quasi-stationary images
(204 words) We have developed a novel method to derive scale information from quasi-stationary images, which relies on a rotation-guided multi-scale analysis of features derived fr...
Piotr W. Mirowski, Daniel M. Tetzlaff
IJFCS
2007
105views more  IJFCS 2007»
14 years 9 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
14 years 9 months ago
Discover gene specific local co-regulations from time-course gene expression data
Discovering gene co-regulatory relationships is one of most important research in DNA microarray data analysis. The problem of gene specific co-regulation discovery is to, for a p...
Ji Zhang, Qigang Gao, Hai H. Wang
AROBOTS
2002
115views more  AROBOTS 2002»
14 years 9 months ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
CORR
2004
Springer
177views Education» more  CORR 2004»
14 years 9 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard