Sciweavers

7150 search results - page 1415 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ENTCS
2007
116views more  ENTCS 2007»
15 years 11 days ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
101
Voted
JUCS
2006
112views more  JUCS 2006»
15 years 11 days ago
A Multi-objective Genetic Approach to Mapping Problem on Network-on-Chip
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
PR
2008
218views more  PR 2008»
15 years 10 days ago
Automatic feature localisation with constrained local models
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
David Cristinacce, Timothy F. Cootes
106
Voted
PAMI
2006
132views more  PAMI 2006»
15 years 10 days ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 10 days ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
« Prev « First page 1415 / 1430 Last » Next »