Sciweavers

583 search results - page 55 / 117
» Finding Answers to Complex Questions
Sort
View
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 10 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
14 years 1 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
13 years 8 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
CANDC
2005
ACM
13 years 10 months ago
Comments on selected fundamental aspects of microarray analysis
Microarrays are becoming a ubiquitous tool of research in life sciences. However, the working principles of microarray-based methodologies are often misunderstood or apparently ig...
Alessandra Riva, Anne-Sophie Carpentier, Bruno Tor...
FQAS
2009
Springer
181views Database» more  FQAS 2009»
14 years 4 months ago
Interlingual Information Extraction as a Solution for Multilingual QA Systems
Information extraction systems have been dealt with at length from the viewpoint of users posing definite questions whose expected answer is to be found in a document collection. T...
Jesús Cardeñosa, Carolina Gallardo, ...