Sciweavers

1170 search results - page 123 / 234
» How Fast Is Too Fast
Sort
View
79
Voted
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 3 months ago
From granular avalanches to fluid turbulences through oozing pastes. A mesoscopic physically-based particle model
In this paper, we describe how we can precisely produce complex and various dynamic morphological features such as structured and chaotic features which occur in sand pilings (pil...
Annie Luciani
146
Voted
CGF
2006
177views more  CGF 2006»
15 years 3 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...
CORR
2006
Springer
121views Education» more  CORR 2006»
15 years 3 months ago
On the Foundations of Universal Sequence Prediction
Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which...
Marcus Hutter
IJFCS
2006
82views more  IJFCS 2006»
15 years 3 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
IJON
2006
85views more  IJON 2006»
15 years 3 months ago
From outliers to prototypes: Ordering data
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
Stefan Harmeling, Guido Dornhege, David M. J. Tax,...