Sciweavers

CORR
2006
Springer
86views Education» more  CORR 2006»
13 years 8 months ago
Optimal Distortion-Power Tradeoffs in Sensor Networks: Gauss-Markov Random Processes
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
CORR
2006
Springer
142views Education» more  CORR 2006»
13 years 8 months ago
Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks
The predominate traffic patterns in a wireless sensor network are many-to-one and one-to-many communication. Hence, the performance of wireless sensor networks is characterized by ...
Richard J. Barton, Rong Zheng
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 8 months ago
Unification of multi-lingual scientific terminological resources using the ISO 16642 standard. The TermSciences initiative
The TermSciences initiative aims at building a multi-purpose and multi-lingual knowledge system from different source vocabularies produced by major French research institutions a...
Majid Khayari, Stéphane Schneider, Isabelle...
CORR
2006
Springer
152views Education» more  CORR 2006»
13 years 8 months ago
APHRODITE: an Anomaly-based Architecture for False Positive Reduction
We present APHRODITE, an architecture designed to reduce false positives in network intrusion-detection systems. APHRODITE works by detecting anomalies in the outgoing traffic, an...
Damiano Bolzoni, Sandro Etalle
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 8 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 8 months ago
Communication Bottlenecks in Scale-Free Networks
Sameet Sreenivasan, Reuven Cohen, Eduardo Ló...
CORR
2006
Springer
164views Education» more  CORR 2006»
13 years 8 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 8 months ago
AS Relationships: Inference and Validation
Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and thorough knowledge of the nature and structure of the c...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, M...