Sciweavers

17329 search results - page 3373 / 3466
» Improved non-approximability results
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 12 hour ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
DAC
2005
ACM
14 years 11 hour ago
A combined feasibility and performance macromodel for analog circuits
The need to reuse the performance macromodels of an analog circuit topology challenges existing regression based modeling techniques. A model of good reusability should have a num...
Mengmeng Ding, Ranga Vemuri
DAC
2005
ACM
14 years 10 hour ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...
ASAP
2007
IEEE
112views Hardware» more  ASAP 2007»
13 years 12 months ago
Scheduling Register-Allocated Codes in User-Guided High-Level Synthesis
In high-level synthesis, as for compilers, an important question is when register assignment should take place. Unlike compilers for which the processor architecture is given, syn...
Alain Darte, C. Quinson
CIVR
2008
Springer
182views Image Analysis» more  CIVR 2008»
13 years 12 months ago
Fusion of audio and visual cues for laughter detection
Past research on automatic laughter detection has focused mainly on audio-based detection. Here we present an audiovisual approach to distinguishing laughter from speech and we sh...
Stavros Petridis, Maja Pantic
« Prev « First page 3373 / 3466 Last » Next »