Sciweavers

61 search results - page 7 / 13
» Indirect text entry using one or two keys
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 10 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
UIST
2009
ACM
16 years 15 days ago
Disappearing mobile devices
In this paper, we extrapolate the evolution of mobile devices in one specific direction, namely miniaturization. While we maintain the concept of a device that people are aware of...
Tao Ni, Patrick Baudisch
AIED
2011
Springer
14 years 9 months ago
Self-assessment of Motivation: Explicit and Implicit Indicators in L2 Vocabulary Learning
Self-assessment motivation questionnaires have been used in classrooms yet many researchers find only a weak correlation between answers to these questions and learning. In this pa...
Kevin Dela Rosa, Maxine Eskenazi
IFIP
2003
Springer
15 years 11 months ago
Power-Saving in Wi-Fi Hotspots: An Analytical Study
Wi-Fi hotspots are one of the most promising scenarios for mobile computing. In this scenario, a very limiting factor is the scarcity of mobile-device energetic resources. Both har...
Giuseppe Anastasi, Marco Conti, Enrico Gregori, An...
JCB
2007
108views more  JCB 2007»
15 years 5 months ago
A Dynamic Programming Approach for Finding Common Patterns in RNAs
We developed a dynamic programming approach of computing common sequence structure patterns among two RNAs given their primary sequences and their secondary structures. Common pat...
Sven Siebert, Rolf Backofen