Sciweavers

397 search results - page 75 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Network Routing Topology Inference from End-to-End Measurements
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...
SIROCCO
2000
13 years 8 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
COCOON
2003
Springer
14 years 23 days ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
CN
2007
168views more  CN 2007»
13 years 7 months ago
A MAC layer power management scheme for efficient energy delay tradeoff in a WLAN
— Energy efficient operation is of paramount importance for battery-powered wireless nodes. In an effort to conserve energy, standard protocols for WLANs have the provision for w...
Mahasweta Sarkar, Rene L. Cruz
ALGOSENSORS
2009
Springer
14 years 2 months ago
A Note on Uniform Power Connectivity in the SINR Model
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...