Sciweavers

849 search results - page 145 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
ICCV
2007
IEEE
14 years 11 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
GLOBECOM
2008
IEEE
14 years 3 months ago
Optimal LLR Clipping Levels for Mixed Hard/Soft Output Detection
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
Ernesto Zimmermann, David L. Milliner, John R. Bar...
CHI
2008
ACM
13 years 11 months ago
Implicit user-adaptive system engagement in speech and pen interfaces
As emphasis is placed on developing mobile, educational, and other applications that minimize cognitive load on users, it is becoming more essential to base interface design on im...
Sharon L. Oviatt, Colin Swindells, Alexander M. Ar...
POPL
2004
ACM
14 years 9 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
ICCAD
2005
IEEE
127views Hardware» more  ICCAD 2005»
14 years 6 months ago
Flip-flop insertion with shifted-phase clocks for FPGA power reduction
— Although the LUT (look-up table) size of FPGAs has been optimized for general applications, complicated designs may contain a large number of cascaded LUTs between flip-flops...
Hyeonmin Lim, Kyungsoo Lee, Youngjin Cho, Naehyuck...