Sciweavers

4332 search results - page 596 / 867
» A Probabilistic Identification Result
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 8 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
CHES
2006
Springer
81views Cryptology» more  CHES 2006»
15 years 8 months ago
Template Attacks in Principal Subspaces
Side-channel attacks are a serious threat to implementations of cryptographic algorithms. Secret information is recovered based on power consumption, electromagnetic emanations or ...
Cédric Archambeau, Eric Peeters, Fran&ccedi...
CIKM
2008
Springer
15 years 6 months ago
Active relevance feedback for difficult queries
Relevance feedback has been demonstrated to be an effective strategy for improving retrieval accuracy. The existing relevance feedback algorithms based on language models and vect...
Zuobing Xu, Ram Akella
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
15 years 5 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
ADHOC
2007
121views more  ADHOC 2007»
15 years 4 months ago
Power-aware single- and multipath geographic routing in sensor networks
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signiï¬...
Shibo Wu, K. Selçuk Candan