Sciweavers

16666 search results - page 3050 / 3334
» Descriptive and Computational Complexity
Sort
View
SIROCCO
2008
15 years 8 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
UAI
2008
15 years 8 months ago
Modelling local and global phenomena with sparse Gaussian processes
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...
Jarno Vanhatalo, Aki Vehtari
AAAI
2004
15 years 8 months ago
Visual Odometry Using Commodity Optical Flow
A wide variety of techniques for visual navigation using robot-mounted cameras have been described over the past several decades, yet adoption of optical flow navigation technique...
Jason Campbell, Rahul Sukthankar, Illah R. Nourbak...
206
Voted
ACST
2006
15 years 8 months ago
PDC: Pattern discovery with confidence in DNA sequences
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Yan Sun, Zijia...
DFN
2003
15 years 8 months ago
High-Efficient Intrusion Detection Infrastructure
In recent years research activities in computer network security focus more actively on the development of effective methods in intrusion detection. The reason for this developmen...
Thomas Holz, Michael Meier, Hartmut König
« Prev « First page 3050 / 3334 Last » Next »