Sciweavers

16430 search results - page 441 / 3286
» On Computable Tree Functions
Sort
View
CGF
2008
118views more  CGF 2008»
15 years 7 months ago
Manifold-valued Thin-Plate Splines with Applications in Computer Graphics
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
Florian Steinke, Matthias Hein, Jan Peters, Bernha...
JOC
2006
71views more  JOC 2006»
15 years 6 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...
CVPR
2009
IEEE
17 years 2 months ago
Dictionary-Free Categorization of Very Similar Objects via Stacked Evidence Trees
Current work in object categorization discriminates among objects that typically possess gross differences which are readily apparent. However, many applications require making ...
Andrew Moldenke, Asako Yamamuro, David A. Lytle, E...
DAC
2006
ACM
16 years 7 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
SAC
2004
ACM
16 years 9 days ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha