Sciweavers

1568 search results - page 279 / 314
» The problem of examination questions in algorithmics
Sort
View
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 7 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 7 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
142
Voted
SIROCCO
2008
15 years 5 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
CIKM
2011
Springer
14 years 3 months ago
Content based social behavior prediction: a multi-task learning approach
The study of information flow analyzes the principles and mechanisms of social information distribution. It is becoming an extremely important research topic in social network re...
Hongliang Fei, Ruoyi Jiang, Yuhao Yang, Bo Luo, Ju...
163
Voted
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 10 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai