Sciweavers

2435 search results - page 311 / 487
» Question Answering in Webclopedia
Sort
View
ENASE
2011
219views Hardware» more  ENASE 2011»
14 years 6 months ago
Mutation Selection: Some Could be Better than All
In previous research, many mutation selection techniques have been proposed to reduce the cost of mutation analysis. After a mutant subset is selected, researchers could obtain a t...
Zhiyi Zhang, Dongjiang You, Zhenyu Chen, Yuming Zh...
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
14 years 6 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
IACR
2011
92views more  IACR 2011»
14 years 6 months ago
From Non-Adaptive to Adaptive Pseudorandom Functions
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
Iftach Haitner, Itay Berman
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 2 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
CORR
2012
Springer
214views Education» more  CORR 2012»
14 years 2 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos