Sciweavers

420 search results - page 69 / 84
» Generating random regular graphs
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Motion estimation from compressed linear measurements
This paper presents a novel algorithm for computing the relative motion between images from compressed linear measurements. We propose a geometry based correlation model that desc...
Vijayaraghavan Thirumalai, Pascal Frossard
IPL
2006
89views more  IPL 2006»
13 years 7 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
14 years 1 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
PADS
2005
ACM
14 years 1 months ago
Software Diversity as a Defense against Viral Propagation: Models and Simulations
The use of software diversity has often been discussed in the research literature as an effective means to break up the software monoculture present on the Internet and to thus p...
Adam J. O'Donnell, Harish Sethu
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...