13621 search results - page 389 / 2725 » Computability and Complexity in Self-assembly |
144
click to vote
JSC
2006
15 years 6 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
171
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
As the complexity and variety of computer system hardware increases, its suitability as a pedagogical tool in computer organization/architecture courses diminishes. As a consequen...
186
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
141
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
173
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
Prior research in scene classification has shown that high-level information can be inferred from low-level image features. Classification rates of roughly 90% have been reported ...