Sciweavers

1295 search results - page 203 / 259
» Palimpsests of Time and Place
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 13 days ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
AIPS
2000
14 years 11 days ago
Vision-Servoed Localization and Behavior-Based Planning for an Autonomous Quadruped Legged Robot
Planning for real robots to act in dynamic and uncertain environments is a challenging problem. A complete model of the world is not viable and an integration of deliberation and ...
Manuela M. Veloso, Elly Winner, Scott Lenser, Jame...
BMCBI
2010
151views more  BMCBI 2010»
13 years 11 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
BMCBI
2008
116views more  BMCBI 2008»
13 years 11 months ago
Structuring an event ontology for disease outbreak detection
Background: This paper describes the design of an event ontology being developed for application in the machine understanding of infectious disease-related events reported in natu...
Ai Kawazoe, Hutchatai Chanlekha, Mika Shigematsu, ...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 11 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...