Sciweavers

1391 search results - page 242 / 279
» Distributed routing in networks using affinity propagation
Sort
View
ICML
2004
IEEE
16 years 18 days ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
SIGCOMM
2009
ACM
15 years 6 months ago
Why should we integrate services, servers, and networking in a data center?
Since the early days of networks, a basic principle has been that endpoints treat the network as a black box. An endpoint injects a packet with a destination address and the netwo...
Paolo Costa, Thomas Zahn, Antony I. T. Rowstron, G...
PEWASUN
2007
ACM
15 years 1 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
CCR
2006
110views more  CCR 2006»
14 years 12 months ago
Estimating network proximity and latency
Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers...
Puneet Sharma, Zhichen Xu, Sujata Banerjee, Sung-J...
MOBIHOC
2002
ACM
15 years 11 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder