13603 search results - page 409 / 2721 » On the Complexity of Computing Treelength |
177
click to vote
JCB
2008
15 years 7 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
163
click to vote
JSC
2006
15 years 7 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...
159
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...
192
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 ...
328
click to vote
GIS
2006
ACM
16 years 8 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...