Sciweavers

1802 search results - page 246 / 361
» Complexity Theory for Operators in Analysis
Sort
View
COMPGEOM
2009
ACM
16 years 27 days ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
COMPGEOM
2009
ACM
16 years 27 days ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
IPSN
2010
Springer
16 years 26 days ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
CDC
2008
IEEE
103views Control Systems» more  CDC 2008»
16 years 25 days ago
Symbolic models for nonlinear control systems affected by disturbances
Abstract— Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growi...
Giordano Pola, Paulo Tabuada
P2P
2007
IEEE
165views Communications» more  P2P 2007»
16 years 19 days ago
An Information-Theoretic Framework for Analyzing Leak of Privacy in Distributed Hash Tables
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...
Souvik Ray, Zhao Zhang