Sciweavers

1941 search results - page 244 / 389
» On the Hardness of Approximate Reasoning
Sort
View
INFFUS
2006
103views more  INFFUS 2006»
15 years 6 months ago
Information fusion approaches to the automatic pronunciation of print by analogy
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
Robert I. Damper, Yannick Marchand
TKDE
2008
126views more  TKDE 2008»
15 years 6 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...
UAIS
2008
185views more  UAIS 2008»
15 years 6 months ago
Facial movement analysis in ASL
In the age of speech and voice recognition technologies, sign language recognition is an essential part of ensuring equal access for deaf people. To date, sign language recognition...
Christian Vogler, Siome Goldenstein
AIR
2002
125views more  AIR 2002»
15 years 6 months ago
Interactive Critiquing for Catalog Navigation in E-Commerce
E-commerce sites can have large, essentially unbounded, catalogs. With large catalogs comes increasing difficulty for buyers in making use of standard search and browsing faciliti...
Robin D. Burke
CAD
2004
Springer
15 years 6 months ago
ESOLID - a system for exact boundary evaluation
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...
John Keyser, Tim Culver, Mark Foskey, Shankar Kris...