Sciweavers

2043 search results - page 376 / 409
» Some Basics on Tolerances
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 4 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
ECOOP
1998
Springer
15 years 4 months ago
Mobile Objects and Mobile Agents: The Future of Distributed Computing?
This paper will lead you into the world of mobile agents, an emerging technology that makes it very much easier to design, implement, and maintain distributed systems. You will fin...
Danny B. Lange
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 4 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
SIGGRAPH
1996
ACM
15 years 3 months ago
Simulating Facial Surgery Using Finite Element Models
This paper describes a prototype system for surgical planning and prediction of human facial shape after craniofacial and maxillofacial surgery for patients with facial deformitie...
Rolf M. Koch, Markus H. Gross, Friedrich R. Carls,...
ICSE
1993
IEEE-ACM
15 years 3 months ago
Prototyping a Process Monitoring Experiment
Features are often the basic unit of development for a very large software systems and represent long-term efforts, spanning up to several years from inception to actual use. Deve...
Mark G. Bradac, Dewayne E. Perry, Lawrence G. Vott...