Sciweavers

477 search results - page 31 / 96
» Removing even crossings
Sort
View
GRAPHICSINTERFACE
2007
13 years 9 months ago
Point-based stream surfaces and path surfaces
We introduce a point-based algorithm for computing and rendering stream surfaces and path surfaces of a 3D flow. The points are generated by particle tracing, and an even distrib...
Tobias Schafhitzel, Eduardo Tejada, Daniel Weiskop...
JAIR
1998
81views more  JAIR 1998»
13 years 7 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
COMPGEOM
2010
ACM
14 years 19 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
DAGSTUHL
2006
13 years 9 months ago
Pre-Routed FPGA Cores for Rapid System Construction in a Dynamic Reconfigurable System
This paper presents a method of constructing pre-routed FPGA cores which lays the foundations for a rapid system construction framework for dynamically reconfigurable computing sy...
Douglas L. Maskell, Timothy F. Oliver
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
14 years 8 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld