Sciweavers

736 search results - page 133 / 148
» Approximating the Number of Network Motifs
Sort
View
PR
2008
123views more  PR 2008»
15 years 1 months ago
Extensions of vector quantization for incremental clustering
In this paper, we extend the conventional vector quantization by incorporating a vigilance parameter, which steers the tradeoff between plasticity and stability during incremental...
Edwin Lughofer
SIAMCO
2010
128views more  SIAMCO 2010»
15 years 9 days ago
A Parallel Splitting Method for Coupled Monotone Inclusions
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions...
Hedy Attouch, Luis M. Briceño-Arias, Patric...
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
14 years 5 months ago
SQPR: Stream query planning with reuse
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hi...
PDCN
2004
15 years 3 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
ATAL
2011
Springer
14 years 1 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...