Sciweavers

166 search results - page 5 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Topological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition
Abstract—We are interested in topological analysis and processing of the large-scale distributed data generated by sensor networks. Naturally a large-scale sensor network is depl...
Xianjin Zhu, Rik Sarkar, Jie Gao
COLT
2000
Springer
14 years 27 days ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
SPAA
2005
ACM
14 years 2 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi

Publication
338views
12 years 6 months ago
A Reference Discretization Strategy for the Numerical Solution of Physical Field Problems.
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi

Publication
519views
12 years 6 months ago
The Finite Volume, Finite Difference, and Finite Elements Methods as Numerical Methods for Physical Field Problems
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi