Sciweavers

1604 search results - page 112 / 321
» Approximation algorithms for developable surfaces
Sort
View
MMAS
2010
Springer
15 years 1 months ago
An Asymptotic Analysis of the Mean First Passage Time for Narrow Escape Problems: Part I: Two-Dimensional Domains
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
S. Pillay, Michael J. Ward, A. Peirce, Theodore Ko...
GRAPHICSINTERFACE
2000
15 years 7 months ago
Model Simplification Through Refinement
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplifica...
Dmitry Brodsky, Benjamin Watson
VLDB
2001
ACM
144views Database» more  VLDB 2001»
16 years 6 months ago
Approximate query processing using wavelets
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev ...
HYBRID
2003
Springer
15 years 11 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
TPDS
2008
120views more  TPDS 2008»
15 years 6 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee