Sciweavers

656 search results - page 48 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
ICMCS
2005
IEEE
128views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Low-complexity automatic speaker recognition in the compressed GSM AMR domain
This paper presents an experimental implementation of a low-complexity speaker recognition algorithm working in the compressed speech domain. The goal is to perform speaker modeli...
Matteo Petracca, Antonio Servetti, Juan Carlos De ...
ISQED
2003
IEEE
85views Hardware» more  ISQED 2003»
15 years 3 months ago
Static Pin Mapping and SOC Test Scheduling for Cores with Multiple Test Sets
An algorithm for mapping core terminals to System-On-a-Chip (SOC) I/O pins and scheduling tests in order to achieve costefficient concurrent test for core-based designs is present...
Yu Huang, Wu-Tung Cheng, Chien-Chung Tsai, Nilanja...
NCA
2003
IEEE
15 years 2 months ago
Optimal Content Placement for En-Route Web Caching
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
Anxiao Jiang, Jehoshua Bruck
CP
2006
Springer
15 years 1 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
ICPR
2010
IEEE
15 years 24 days ago
Robust Staffline Thickness and Distance Estimation in Binary and Gray-Level Music Scores
The optical recognition of handwritten musical scores by computers remains far from ideal. Most OMR algorithms rely on an estimation of the staffline thickness and the vertical lin...
Jaime Cardoso S., Rebelo Silva