Sciweavers

224 search results - page 7 / 45
» The Complexity of Finding Replicas Using Equality Tests
Sort
View
ITC
1998
IEEE
174views Hardware» more  ITC 1998»
15 years 1 months ago
High volume microprocessor test escapes, an analysis of defects our tests are missing
This paper explores defects found in a high volume microprocessor when shipping at a low defect level. A brief description of the manufacturing flow along with definition of DPM i...
Wayne M. Needham, Cheryl Prunty, Yeoh Eng Hong
CAD
2000
Springer
14 years 9 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
66
Voted
ICPR
2006
IEEE
15 years 10 months ago
GMM-based SVM for face recognition
A new face recognition algorithm is presented. It supposes that a video sequence of a person is available both at enrollment and test time. During enrollment, a client Gaussian Mi...
Gérard Chollet, Hervé Bredin, Najim ...
ICCS
2007
Springer
15 years 3 months ago
Agent Based Load Balancing Middleware for Service-Oriented Applications
Kinds of load balancing middleware have already been applied successfully in distributed computing. However, they don’t take the services types into consideration and for differe...
Jun Wang, Yi Ren, Di Zheng, Quanyuan Wu
TIT
2008
102views more  TIT 2008»
14 years 9 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo