Sciweavers

1425 search results - page 152 / 285
» Beyond Dependency Graphs
Sort
View
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 8 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
ECRTS
2008
IEEE
14 years 2 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
14 years 2 months ago
Complex network topologies and synchronization
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
Paolo Checco, Mario Biey, Gábor Vattay, Lju...
ADHOCNOW
2004
Springer
14 years 1 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...