Sciweavers

1029 search results - page 179 / 206
» Neural Networks and Complexity Theory
Sort
View
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
16 years 13 days ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
COMCOM
2006
147views more  COMCOM 2006»
14 years 12 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
WWW
2008
ACM
16 years 15 days ago
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...
Yu-Ru Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, B...
INFOCOM
2007
IEEE
15 years 6 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
CSCW
2006
ACM
15 years 5 months ago
Improving network efficiency in real-time groupware with general message compression
Groupware communicates by sending messages across the network, and groupware programmers use a variety of formats for these messages, such as XML, plain text, or serialized object...
Carl Gutwin, Christopher Fedak, Mark Watson, Jeff ...