2767 search results - page 280 / 554 » Universal Exponentiation Algorithm |
114
click to vote
IROS
2007
IEEE
15 years 9 months ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
113
Voted
ICSM
2006
IEEE
15 years 8 months ago
2006
IEEE
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
114
Voted
COLT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
137
Voted
COLT
2005
Springer
15 years 8 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
117
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...