Sciweavers

896 search results - page 2 / 180
» On completeness of word reversing
Sort
View
TCS
2008
13 years 5 months ago
Reversible computing and cellular automata - A survey
Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...
Kenichi Morita
ASSETS
2006
ACM
13 years 11 months ago
From letters to words: efficient stroke-based word completion for trackball text entry
We present a major extension to our previous work on Trackball EdgeWrite—a unistroke text entry method for trackballs—by taking it from a character-level technique to a word-l...
Jacob O. Wobbrock, Brad A. Myers
CSFW
2006
IEEE
13 years 11 months ago
On the Completeness of Attack Mutation Algorithms
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...
Shai Rubin, Somesh Jha, Barton P. Miller
IJAC
2006
93views more  IJAC 2006»
13 years 5 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest
ICML
2001
IEEE
14 years 6 months ago
Learning to Select Good Title Words: An New Approach based on Reverse Information Retrieval
In this paper, we show how we can learn to select good words for a document title. We view the problem of selecting good title words for a document as a variant of an Information ...
Rong Jin, Alexander G. Hauptmann