Sciweavers

680 search results - page 82 / 136
» Optimal spot-checking to minimize the computation time in vo...
Sort
View
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
15 years 3 months ago
Temporal partitioning for image processing based on time-space complexity in reconfigurable architectures
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...
Paulo Sérgio B. do Nascimento, Manoel Euseb...
ECCV
2010
Springer
14 years 11 months ago
A coarse-to-fine taxonomy of constellations for fast multi-class object detection
In order for recognition systems to scale to a larger number of object categories building visual class taxonomies is important to achieve running times logarithmic in the number o...
RECOMB
2004
Springer
15 years 10 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
IPPS
2006
IEEE
15 years 3 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
ICSOC
2010
Springer
14 years 8 months ago
Adaptive Management of Composite Services under Percentile-Based Service Level Agreements
We present a brokering service for the adaptive management of composite services. The goal of this broker is to dynamically adapt at runtime the composite service configuration, ...
Valeria Cardellini, Emiliano Casalicchio, Vincenzo...