Sciweavers

1604 search results - page 164 / 321
» Regularization on Discrete Spaces
Sort
View
FP
1989
124views Formal Methods» more  FP 1989»
15 years 7 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
141
Voted
AAAI
2007
15 years 5 months ago
Adaptive Localization in a Dynamic WiFi Environment through Multi-view Learning
Accurately locating users in a wireless environment is an important task for many pervasive computing and AI applications, such as activity recognition. In a WiFi environment, a m...
Sinno Jialin Pan, James T. Kwok, Qiang Yang, Jeffr...
124
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
ICCSA
2004
Springer
15 years 9 months ago
Reverse Subdivision Multiresolution for Polygonal Silhouette Error Correction
Abstract. This paper presents a method for automatic removal of artifacts that appear in silhouettes extracted from polygonal meshes due to the discrete nature of meshes and numeri...
Kevin Foster, Mario Costa Sousa, Faramarz F. Samav...
ARTS
1999
Springer
15 years 7 months ago
Verifying Progress in Timed Systems
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...
Stavros Tripakis