7195 search results - page 1030 / 1439 » On Computing Power |
170
click to vote
RTA
1991
Springer
15 years 10 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
191
Voted
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
193
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Template matching is a common approach for identifying fluorescent objects within a biological image. But how to decide a threshold value for the purpose of justifying the goodness...
213
Voted
DAC
2010
ACM
2010
ACM
A probabilistic and energy-efficient scheduling approach for online application in real-time systems
15 years 10 months ago
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the ex...
257
Voted
SGP
2007
15 years 9 months ago
2007
Geometric flows are ubiquitous in mesh processing. Curve and surface evolutions based on functional minimization have been used in the context of surface diffusion, denoising, sha...