3818 search results - page 313 / 764 » Word Problems on Compressed Words |
149
click to vote
JUCS
2002
15 years 6 months ago
2002
: Being lost in space and overloaded with information are two key problems users are confronted with, when searching for appropriate information. Trails built from information abou...
163
click to vote
NPL
2002
15 years 6 months ago
2002
Recently, feature maps have been applied to various problem domains.The success of some of these applications critically depends on whether feature maps are topologically ordered. ...
182
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
141
click to vote
IANDC
2010
15 years 5 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
195
click to vote
ICONIP
2010
15 years 5 months ago
2010
Abstract. In this paper, we propose a novel approach for adaptive control of robotic manipulators. Our approach uses a representation of inverse dynamics models learned from a vari...