Sciweavers

108 search results - page 19 / 22
» On Computing the Centroid of the Vertices of an Arrangement ...
Sort
View
WWW
2004
ACM
14 years 8 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
CVPR
2000
IEEE
14 years 9 months ago
On the Number of Samples Needed in Light Field Rendering with Constant-Depth Assumption
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
Zhouchen Lin, Heung-Yeung Shum
SCALESPACE
2007
Springer
14 years 1 months ago
A Consistent Spatio-temporal Motion Estimator for Atmospheric Layers
In this paper, we address the problem of estimating mesoscale dynamics of atmospheric layers from satellite image sequences. Relying on a physically sound vertical decomposition of...
Patrick Héas, Étienne Mémin, ...
IS
2007
13 years 7 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis