Sciweavers

2520 search results - page 446 / 504
» The complexity of approximating entropy
Sort
View
CGF
2011
14 years 1 months ago
A Sparse Parametric Mixture Model for BTF Compression, Editing and Rendering
Bidirectional texture functions (BTFs) represent the appearance of complex materials. Three major shortcomings with BTFs are the bulky storage, the difficulty in editing and the ...
Hongzhi Wu, Julie Dorsey, Holly E. Rushmeier
PPOPP
2011
ACM
14 years 26 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
AAAI
2011
13 years 10 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
ATMOS
2011
261views Optimization» more  ATMOS 2011»
13 years 10 months ago
On the Utilisation of Fuzzy Rule-Based Systems for Taxi Time Estimations at Airports
The primary objective of this paper is to introduce Fuzzy Rule-Based Systems (FRBSs) as a relatively new technology into airport transportation research, with a special emphasis o...
Jun Chen, Stefan Ravizza, Jason A. D. Atkin, Paul ...
ICDAR
2011
IEEE
13 years 9 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal