Sciweavers

1802 search results - page 82 / 361
» Complexity Theory for Operators in Analysis
Sort
View
CORR
2006
Springer
78views Education» more  CORR 2006»
15 years 6 months ago
What is the probability of connecting two points ?
The two-terminal reliability, known as the pair connectedness or connectivity function in percolation theory, may actually be expressed as a product of transfer matrices in which t...
Christian Tanguy
COMPLEX
2009
Springer
16 years 20 days ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 11 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
15 years 6 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
SOSP
2003
ACM
16 years 3 months ago
RacerX: effective, static detection of race conditions and deadlocks
This paper describes RacerX, a static tool that uses flowsensitive, interprocedural analysis to detect both race conditions and deadlocks. It is explicitly designed to find erro...
Dawson R. Engler, Ken Ashcraft