Sciweavers

7228 search results - page 99 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 1 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
131
Voted
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
PAMI
2006
440views more  PAMI 2006»
15 years 3 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
ICASSP
2010
IEEE
15 years 1 months ago
Sectored Random Projections for Cancelable Iris Biometrics
Privacy and security are essential requirements in practical biometric systems. In order to prevent the theft of biometric patterns, it is desired to modify them through revocable...
Jaishanker K. Pillai, Vishal M. Patel, Rama Chella...
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
14 years 10 months ago
Nonholonomic source seeking in switching random fields
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
Shun-ichi Azuma, Mahmut Selman Sakar, George J. Pa...