Sciweavers

473 search results - page 78 / 95
» Local Search in Unstructured Networks
Sort
View
CCR
2006
117views more  CCR 2006»
14 years 10 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
PVLDB
2010
106views more  PVLDB 2010»
14 years 8 months ago
Just-in-time Data Integration in Action
Today’s data integration systems must be flexible enough to support the typical iterative and incremental process of integration, and may need to scale to hundreds of data sour...
Martin Hentschel, Laura M. Haas, Renée J. M...
WWW
2003
ACM
15 years 10 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
BMCBI
2008
174views more  BMCBI 2008»
14 years 10 months ago
Evolutionary approaches for the reverse-engineering of gene regulatory networks: A study on a biologically realistic dataset
Background: Inferring gene regulatory networks from data requires the development of algorithms devoted to structure extraction. When only static data are available, gene interact...
Cédric Auliac, Vincent Frouin, Xavier Gidro...
ISCC
2006
IEEE
112views Communications» more  ISCC 2006»
15 years 3 months ago
The Precision and Energetic Cost of Snapshot Estimates in Wireless Sensor Networks
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...
Paul G. Flikkema