Sciweavers

30 search results - page 1 / 6
» Code Completion from Abbreviated Input
Sort
View
KBSE
2009
IEEE
13 years 11 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
NLE
2007
148views more  NLE 2007»
13 years 4 months ago
Abbreviated text input using language modeling
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on mobile computing devices or by disabled users), by ta...
Stuart M. Shieber, Rani Nelken
DDECS
2009
IEEE
95views Hardware» more  DDECS 2009»
13 years 11 months ago
Self-timed full adder designs based on hybrid input encoding
—Self-timed full adder designs based on commercial synchronous resources (standard cells), constructed using a mix of complete delay-insensitive codes adopted for inputs are desc...
Padnamabhan Balasubramanian, D. A. Edwards, C. Bre...
ISCAS
2007
IEEE
117views Hardware» more  ISCAS 2007»
13 years 11 months ago
Quantifying Input and Output Spike Statistics of a Winner-Take-All Network in a Vision System
— Event-driven spike-based processing systems offer new possibilities for real-time vision. Signals are encoded asynchronously in time thus preserving the time information of the...
Matthias Oster, Rodney J. Douglas, Shih-Chii Liu
GRAMMARS
2002
119views more  GRAMMARS 2002»
13 years 4 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an