747 search results - page 28 / 150 » Theory and Construction of Molecular Computers |
141
click to vote
ISVC
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
162
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
153
click to vote
REX
1991
15 years 9 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
176
click to vote
IBERAMIA
2004
Springer
15 years 11 months ago
2004
Springer
Early work on Case Based Reasoning reported in the literature shows the importance of soft computing techniques applied to different stages of the classical 4-step CBR life cycle. ...
151
click to vote
GLVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...