Sciweavers

239 search results - page 27 / 48
» Hardness and algorithms for rainbow connection
Sort
View
FSTTCS
2009
Springer
15 years 6 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
SCIA
2007
Springer
151views Image Analysis» more  SCIA 2007»
15 years 5 months ago
A PCA-Based Technique to Detect Moving Objects
Abstract. Moving objects detection is a crucial step for video surveillance systems. The segmentation performed by motion detection algorithms is often noisy, which makes it hard t...
Nicolas Verbeke, Nicole Vincent
IDEAS
2008
IEEE
256views Database» more  IDEAS 2008»
15 years 6 months ago
WIDS: a sensor-based online mining wireless intrusion detection system
This paper proposes WIDS, a wireless intrusion detection system, which applies data mining clustering technique to wireless network data captured through hardware sensors for purp...
Christie I. Ezeife, Maxwell Ejelike, Akshai K. Agg...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
EUROSYS
2011
ACM
14 years 3 months ago
CloneCloud: elastic execution between mobile device and cloud
Mobile applications are becoming increasingly ubiquitous and provide ever richer functionality on mobile devices. At the same time, such devices often enjoy strong connectivity wi...
Byung-Gon Chun, Sunghwan Ihm, Petros Maniatis, May...