Sciweavers

6045 search results - page 942 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 10 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
ICCAD
1995
IEEE
134views Hardware» more  ICCAD 1995»
15 years 10 months ago
A delay model for logic synthesis of continuously-sized networks
ng certain electrical noise and power constraints.Abstract: We present a new delay model for use in logic synthesis. A traditional model treats the area of a library cell as consta...
Joel Grodstein, Eric Lehman, Heather Harkness, Bil...
ICMCS
2010
IEEE
194views Multimedia» more  ICMCS 2010»
15 years 6 months ago
Speech emotion estimation in 3D space
Speech processing is an important aspect of affective computing. Most research in this direction has focused on classifying emotions into a small number of categories. However, nu...
Dongrui Wu, Thomas D. Parsons, Emily Mower, Shrika...
TIP
2008
287views more  TIP 2008»
15 years 6 months ago
3-D Object Recognition Using 2-D Views
We consider the problem of recognizing 3-D objects from 2-D images using geometric models and assuming different viewing angles and positions. Our goal is to recognize and localize...
Wenjing Li, George Bebis, Nikolaos G. Bourbakis
MICCAI
1999
Springer
15 years 11 months ago
Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation
Interpolation is required in many medical image processing operations. From sampling theory, it follows that the ideal interpolation kernel is the sinc function, which is of infin...
Erik H. W. Meijering, Wiro J. Niessen, Josien P. W...