Sciweavers

1960 search results - page 127 / 392
» The Logic of Large Enough
Sort
View
ISCAS
2007
IEEE
136views Hardware» more  ISCAS 2007»
14 years 3 months ago
Flexible Low Power Probability Density Estimation Unit For Speech Recognition
— This paper describes the hardware architecture for a flexible probability density estimation unit to be used in a Large Vocabulary Speech Recognition System, and targeted for m...
Ullas Pazhayaveetil, Dhruba Chandra, Paul Franzon
ICALP
2007
Springer
14 years 3 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
IDEAL
2007
Springer
14 years 3 months ago
A Framework to Analyze Biclustering Results on Microarray Experiments
Microarray technology produces large amounts of information to be manipulated by analysis methods, such as biclustering algorithms, to extract new knowledge. All-purpose multivaria...
Rodrigo Santamaría, Roberto Therón, ...
MFCS
2007
Springer
14 years 3 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
DOCENG
2006
ACM
14 years 3 months ago
Solving the simple continuous table layout problem
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
Nathan Hurst, Kim Marriott, David W. Albrecht