Sciweavers

193 search results - page 31 / 39
» Key Derivation for Squared-Friendly Applications: Lower Boun...
Sort
View
IPSN
2005
Springer
15 years 3 months ago
Towards optimal sleep scheduling in sensor networks for rare-event detection
— Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a boun...
Qing Cao, Tarek F. Abdelzaher, Tian He, John A. St...
79
Voted
FOCS
1994
IEEE
15 years 1 months ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 9 months ago
Natural pseudo-distance and optimal matching between reduced size functions
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
Michele d'Amico, Patrizio Frosini, Claudia Landi
MA
2010
Springer
132views Communications» more  MA 2010»
14 years 8 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki
ICALP
2009
Springer
15 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner