Sciweavers

3359 search results - page 468 / 672
» A Simplified Idea Algorithm
Sort
View
IJCAI
1993
15 years 1 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 1 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
107
Voted
ICML
2010
IEEE
15 years 1 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
95
Voted
MM
2010
ACM
186views Multimedia» more  MM 2010»
15 years 19 days ago
Hybrid load balancing for online games
As massively multiplayer online games are becoming very popular, how to support a large number of concurrent users while maintaining the game performance has become an important r...
Rynson W. H. Lau
105
Voted
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
15 years 17 days ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai