Sciweavers

1730 search results - page 177 / 346
» Open Archiving for Open Research
Sort
View
95
Voted
CCR
2002
113views more  CCR 2002»
14 years 10 months ago
A secure multicast protocol with copyright protection
We present a simple, efficient, and secure multicast protocol with copyright protection in an open and insecure network environment. There is a wide variety of multimedia applicat...
Hao-Hua Chu, Lintian Qiao, Klara Nahrstedt, Hua Wa...
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
13 years 18 days ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
IMCS
2007
144views more  IMCS 2007»
14 years 10 months ago
On the imbalance of the security problem space and its expected consequences
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
Konstantin Beznosov, Olga Beznosova
JUCS
2010
147views more  JUCS 2010»
14 years 8 months ago
Ambient Intelligence: Beyond the Inspiring Vision
Abstract: Ambient Intelligence (AmI) has emerged in the past 10 years as a multidisciplinary field within ubiquitous computing, attracting considerable research, funding and publi...
Rui José, Helena Rodrigues, Nuno Otero
86
Voted
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
15 years 10 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...