Sciweavers

14386 search results - page 2479 / 2878
» The Chinese Generals Problem
Sort
View
NEUROSCIENCE
2001
Springer
15 years 11 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
SSD
2001
Springer
218views Database» more  SSD 2001»
15 years 11 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
15 years 11 months ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...
FOCS
2000
IEEE
15 years 11 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
203
Voted
ACMDIS
2000
ACM
15 years 11 months ago
PaperButtons: Expanding a Tangible User Interface
: Expanding the functionality of a successful system is always a challenge; the initial simplicity and ease-of-use is easily lost in the process. Experience indicates that this pro...
Elin Rønby Pedersen, Tomas Sokoler, Les Nel...
« Prev « First page 2479 / 2878 Last » Next »