Sciweavers

1778 search results - page 19 / 356
» On the Power of the Randomized Iterate
Sort
View
66
Voted
JCT
2011
90views more  JCT 2011»
14 years 4 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
14 years 11 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
15 years 3 months ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
54
Voted
CONCUR
2009
Springer
15 years 4 months ago
Power of Randomization in Automata on Infinite Strings
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan