Sciweavers

310 search results - page 2 / 62
» Why Delannoy numbers
Sort
View
SPIRE
2010
Springer
13 years 3 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
JMLR
2010
106views more  JMLR 2010»
12 years 11 months ago
Why Does Unsupervised Pre-training Help Deep Learning?
Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of auto-encoder variants, with impressive results obtai...
Dumitru Erhan, Yoshua Bengio, Aaron C. Courville, ...
SYNTHESE
2010
70views more  SYNTHESE 2010»
13 years 3 months ago
What ought probably means, and why you can't detach it
: Some intuitive normative principles raise vexing „detaching problems‟ by their failure to license modus ponens. I examine three such principles (a self-reliance principle and...
Stephen Finlay
SIGIR
2011
ACM
12 years 7 months ago
Why searchers switch: understanding and predicting engine switching rationales
Search engine switching is the voluntary transition between Web search engines. Engine switching can occur for a number of reasons, including user dissatisfaction with search resu...
Qi Guo, Ryen W. White, Yunqiao Zhang, Blake Anders...