Sciweavers

26 search results - page 4 / 6
» On the Dimensions of Context Dependence: Partiality, Approxi...
Sort
View
JAT
2010
109views more  JAT 2010»
13 years 6 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
CGF
2010
111views more  CGF 2010»
13 years 7 months ago
One Point Isometric Matching with the Heat Kernel
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
Maks Ovsjanikov, Quentin Mérigot, Facundo M...
CC
2012
Springer
227views System Software» more  CC 2012»
12 years 3 months ago
Programming Paradigm Driven Heap Analysis
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
Mark Marron, Ondrej Lhoták, Anindya Banerje...
ICC
2007
IEEE
146views Communications» more  ICC 2007»
14 years 1 months ago
Correlation Based Rate Adaptation via Insights from Incomplete Observations in 802.11 Networks
—Rate adaptation, as a challenging issue for wireless purpose. Relatively little attention has been paid on identifying network design, has been an active research topic for year...
Xia Zhou, Jun Zhao, Guang-Hua Yang
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 10 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...