Sciweavers

7978 search results - page 619 / 1596
» Combining shared-coin algorithms
Sort
View
IJCAI
1993
15 years 8 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
ICML
2010
IEEE
15 years 8 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
SIGIR
2010
ACM
15 years 7 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
CGF
2008
84views more  CGF 2008»
15 years 7 months ago
Frame Sequential Interpolation for Discrete Level-of-Detail Rendering
In this paper we present a method for automatic interpolation between adjacent discrete levels of detail to achieve smooth LOD changes in image space. We achieve this by breaking ...
Daniel Scherzer, Michael Wimmer
COMCOM
2008
102views more  COMCOM 2008»
15 years 7 months ago
Bluebot: Asset tracking via robotic location crawling
From manufacturers, distributors, and retailers of consumer goods to government departments, enterprises of all kinds are gearing up to use RFID technology to increase the visibil...
Abhishek Patil, Jonathan Munson, David Wood, Alan ...