19320 search results - page 321 / 3864 » On the complexity of computing determinants |
158
click to vote
INTERACT
2007
15 years 8 months ago
2007
This paper investigates novel ways to direct computers by eye gaze. Instead of using fixations and dwell times, this work focuses on eye motion, in particular gaze gestures. Gaze g...
170
click to vote
ICANN
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Reservoir Computing (RC) uses a randomly created recurrent neural network where only a linear readout layer is trained. In this work, RC is used for detecting complex eve...
158
click to vote
UC
2005
Springer
16 years 6 days ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
136
click to vote
AISC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
184
click to vote
IJCAI
1993
15 years 8 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...