Sciweavers

5350 search results - page 337 / 1070
» Space and time in eco-ontologies
Sort
View
JCDCG
2000
Springer
15 years 10 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman
COMPGEOM
1991
ACM
15 years 10 months ago
The Two Guards Problem
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
Christian Icking, Rolf Klein
AAAI
2006
15 years 8 months ago
A Fast Decision Tree Learning Algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
Jiang Su, Harry Zhang
ESANN
2001
15 years 8 months ago
A divide-and-conquer learning architecture for predicting unknown motion
Time varying environments or model selection problems lead to crucial dilemmas in identification and control science. In this paper, we propose a modular prediction scheme consisti...
Patrice Wira, Jean-Philippe Urban, Julien Gresser
IJCAI
2003
15 years 8 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf