4112 search results - page 658 / 823 » Efficient Algorithms for the Spoonerism Problem |
154
click to vote
COLING
1996
15 years 6 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
175
click to vote
AIPS
2009
15 years 5 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
167
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
180
Voted
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
134
click to vote
APLAS
2010
ACM
15 years 4 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...