Sciweavers

1395 search results - page 165 / 279
» Modeling betweenness for question answering
Sort
View
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 10 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
LICS
1996
IEEE
15 years 10 months ago
The Theory of Hybrid Automata
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
Thomas A. Henzinger
CCS
2006
ACM
15 years 10 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...
EDOC
2004
IEEE
15 years 10 months ago
Towards an MDA-Oriented UML Profile for Distribution
The era of distributed systems is upon us. Middlewarespecific concerns, and especially the distribution concern, which is the core of any middleware-mediated application, are addr...
Raul Silaghi, Frédéric Fondement, Al...
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 7 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen