Sciweavers

3708 search results - page 65 / 742
» Approximating Betweenness Centrality
Sort
View
87
Voted
DAC
1996
ACM
15 years 4 months ago
A Technique for Synthesizing Distributed Burst-mode Circuits
We offer a technique to partition a centralized control-flow graph to obtain distributed control in the context of asynchronous highlevel synthesis. The technique targets Huffman-...
Prabhakar Kudva, Ganesh Gopalakrishnan, Hans M. Ja...
CACM
1999
49views more  CACM 1999»
15 years 7 days ago
OO Distributed Programming is Not Distributed OO Programming
centralized abstractions. The metaphor of a community of independent objects communicating by passing messages is misleading and dangerous when thinking in terms of a distributed s...
Rachid Guerraoui, Mohamed Fayad
109
Voted
EUSFLAT
2009
120views Fuzzy Logic» more  EUSFLAT 2009»
14 years 10 months ago
On M-Approximative Operators and M-Approximative Systems
Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...
Alexander P. Sostak
MOBIHOC
2003
ACM
16 years 4 days ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
EDBT
2010
ACM
246views Database» more  EDBT 2010»
15 years 7 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...