Sciweavers

290 search results - page 44 / 58
» Network as a Computer: Ranking Paths to Find Flows
Sort
View
HPDC
2003
IEEE
15 years 3 months ago
Distributed Pagerank for P2P Systems
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
Karthikeyan Sankaralingam, Simha Sethumadhavan, Ja...
WINET
2002
144views more  WINET 2002»
14 years 9 months ago
Exposure in Wireless Sensor Networks: Theory and Practical Solutions
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...
Seapahn Megerian, Farinaz Koushanfar, Gang Qu, Gia...
ACIVS
2006
Springer
15 years 3 months ago
Color-Based Multiple Agent Tracking for Wireless Image Sensor Networks
This paper presents an implementation of a color-based multiple agent tracking algorithm targeted for wireless image sensor networks. The proposed technique is based on employing l...
Emre Oto, Frances Lau, Hamid K. Aghajan
TCS
2008
14 years 9 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun
FOCS
1999
IEEE
15 years 2 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl