Sciweavers

IJBC
2007
72views more  IJBC 2007»
13 years 4 months ago
Centrality Estimation in Large Networks
Centrality indices are an essential concept in network analysis. For those based on shortest-path distances the computation is at least quadratic in the number of nodes, since it ...
Ulrik Brandes, Christian Pich
ENTCS
2002
127views more  ENTCS 2002»
13 years 4 months ago
A Calculus for "Environment-Aware" Computation
We present a calculus for modelling "environment-aware" computations, that is computations that adapt their behaviour according to the capabilities of the environment. T...
Viviana Bono, Ferruccio Damiani, Paola Giannini
ENTCS
2007
101views more  ENTCS 2007»
13 years 4 months ago
A Framework for Timed Concurrent Constraint Programming with External Functions
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
María Alpuente, Bernhard Gramlich, Alicia V...
DC
2007
13 years 4 months ago
A family of optimal termination detection algorithms
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
GRID
2006
Springer
13 years 4 months ago
Snapshot Processing in Streaming Environments
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...
Daniel M. Zimmerman, K. Mani Chandy
ECCC
2006
107views more  ECCC 2006»
13 years 4 months ago
Energy Complexity and Entropy of Threshold Circuits
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas
CORR
2008
Springer
185views Education» more  CORR 2008»
13 years 5 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
13 years 5 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
EUROPAR
2010
Springer
13 years 5 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 6 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...