Sciweavers

7988 search results - page 1387 / 1598
» A Useful Undecidable Theory
Sort
View
MOBICOM
2004
ACM
15 years 9 months ago
FLSS: a fault-tolerant topology control algorithm for wireless networks
Topology control algorithms usually reduce the number of links in a wireless network, which in turn decreases the degree of connectivity. The resulting network topology is more su...
Ning Li, Jennifer C. Hou
SAC
2004
ACM
15 years 9 months ago
An architecture for information retrieval over semi-collaborating Peer-to-Peer networks
Peer-to-Peer (P2P) networking is aimed at exploiting the potential of widely distributed information pools and its effortless access and retrieval irrespectively of underlying net...
Iraklis A. Klampanos, Joemon M. Jose
SENSYS
2004
ACM
15 years 9 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
SPAA
2004
ACM
15 years 9 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CIKM
2004
Springer
15 years 9 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
« Prev « First page 1387 / 1598 Last » Next »