Sciweavers

866 search results - page 64 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
CCR
2010
203views more  CCR 2010»
15 years 6 months ago
Minimizing energy consumptions in wireless sensor networks via two-modal transmission
We present a sophisticated framework to systematically explore the temporal correlation in environmental monitoring wireless sensor networks. The presented framework optimizes los...
Yao Liang, Wei Peng
TGIS
2010
86views more  TGIS 2010»
15 years 1 months ago
A Road Network Selection Process Based on Data Enrichment and Structure Detection
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
Guillaume Touya
INFOCOM
2003
IEEE
15 years 11 months ago
Instability Phenomena in Underloaded Packet Networks with QoS Schedulers
— Instability in packet-switching networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload gene...
Marco Ajmone Marsan, Mirko Franceschinis, Emilio L...
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 11 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...