Sciweavers

444 search results - page 80 / 89
» More Colourful Simplices
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 11 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
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
SOUPS
2010
ACM
13 years 11 months ago
Usably secure, low-cost authentication for mobile banking
This paper explores user authentication schemes for banking systems implemented over mobile phone networks in the developing world. We analyze an authentication scheme currently d...
Saurabh Panjwani, Edward Cutrell
CGI
2004
IEEE
13 years 11 months ago
Physically-Based Simulation of Objects Represented by Surface Meshes
Objects and scenes in virtual worlds such as 3-d computer games are typically represented by polygonal surface meshes. On the other hand, physically-based simulations of deformati...
Matthias Müller, Matthias Teschner, Markus H....
PADL
2000
Springer
13 years 11 months ago
Transformation-by-Example for XML
Abstract. xml is a language for describing markup languages for structured data. A growing number of applications that process xml documents are transformers, i.e., programs that c...
Shriram Krishnamurthi, Kathryn E. Gray, Paul T. Gr...