Sciweavers

530 search results - page 17 / 106
» Universal randomized switching
Sort
View
136
Voted
DAC
1997
ACM
15 years 5 months ago
Technology-Dependent Transformations for Low-Power Synthesis
We propose a methodology for applying gate-level logic transformations to optimize power in digital circuits. Statistically simulated[14] switching information, gate delays, signa...
Rajendran Panda, Farid N. Najm
TRIDENTCOM
2006
IEEE
15 years 7 months ago
A testbed demonstrating optical IP switching (OIS) in disaggregated network architectures
: The lack of a unified control plane does not allow current optical networks to dynamically provision new optical paths. The IETF standardization body has proposed the Generalized...
Marco Ruffini, Donal O'Mahony, Linda Doyle
TIP
2010
119views more  TIP 2010»
14 years 8 months ago
Trajectory Classification Using Switched Dynamical Hidden Markov Models
This paper proposes an approach for recognizing human activities (more specifically, pedestrian trajectories) in video sequences, in a surveillance context. A system for automatic ...
Jacinto C. Nascimento, Mário A. T. Figueire...
137
Voted
CP
2007
Springer
15 years 8 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
124
Voted
CCS
2009
ACM
16 years 2 months ago
Universally composable contributory group key exchange
We treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by maliciou...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...