Sciweavers

1458 search results - page 142 / 292
» Monads for incremental computing
Sort
View
NEUROSCIENCE
2001
Springer
15 years 8 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
118
Voted
SIGGRAPH
1996
ACM
15 years 7 months ago
Hierarchical View-Dependent Structures for Interactive Scene Manipulation
The result of a scene manipulation is usually displayed by rerendering the entire image even if the change has affected only a small portion of it. This paper presents a system th...
Normand Brière, Pierre Poulin

Publication
535views
17 years 3 months ago
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
ICML
2003
IEEE
16 years 4 months ago
SimpleSVM
We present a fast iterative support vector training algorithm for a large variety of different formulations. It works by incrementally changing a candidate support vector set usin...
S. V. N. Vishwanathan, Alex J. Smola, M. Narasimha...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 3 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...