Sciweavers

CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 6 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...
CORR
2010
Springer
45views Education» more  CORR 2010»
13 years 6 months ago
How to generate an object under an ordinary Boltzmann distribution via an exponential Boltzmann sampler
Abstract. This short note presents an efficient way to derive from an exponential Boltzmann sampler a ordinary Boltzmann sampler. Cette note rapide pr´esente une fa¸con efficace ...
Olivier Bodini
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 6 months ago
The Study State Analysis of Tandem Queue with Blocking and Feedback
-----------------------------------------------ABSTRACT----------------------------------------Computer system models provide detailed answer to system performance. In this paper a...
C. Chandra Sekhar Reddy, K. Ramakrishna Prasad, Ma...
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 6 months ago
Network Intrusion Detection Using FP Tree Rules
----------------------------------------------ABSTRACT-------------------------------------------In the faceless world of the Internet, online fraud is one of the greatest reasons ...
P. Srinivasulu, J. Ranga Rao, I. Ramesh Babu
CORR
2010
Springer
371views Education» more  CORR 2010»
13 years 6 months ago
Experimentation for Packet Loss on MSP430 and nRF24L01 Based Wireless Sensor Network
-------------------------------------------ABSTRACT---------------------------------------In this paper, a new design of wireless sensor network (WSN) node is discussed which is ba...
S. S. Sonavane, B. P. Patil, V. Kumar
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 6 months ago
Simulation of Computer Network Attacks
In this work we present a prototype for simulating computer network attacks. Our objective is to simulate large networks (thousands of hosts, with applications and vulnerabilities)...
Carlos Sarraute, Fernando Miranda, José Ign...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 6 months ago
Centrality Metric for Dynamic Networks
Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many...
Kristina Lerman, Rumi Ghosh, Jeon Hyung Kang
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 6 months ago
Choosability in geometric hypergraphs
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
Panagiotis Cheilaris, Shakhar Smorodinsky
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 6 months ago
Feedback Capacity of the Gaussian Interference Channel to within 2 Bits
We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We dev...
Changho Suh, David Tse
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
Distribution of Cognitive Load in Web Search
The search task and the system both affect the demand on cognitive resources during information search. In some situations, the demands may become too high for a person. This arti...
Jacek Gwizdka