Sciweavers

905 search results - page 31 / 181
» On the Complexity of uSPR Distance
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
SIGGRAPH
2000
ACM
14 years 25 days ago
Adaptively sampled distance fields: a general representation of shape for computer graphics
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
Sarah F. Frisken Gibson, Ronald N. Perry, Alyn P. ...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 10 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh
TALG
2010
158views more  TALG 2010»
13 years 3 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
ICALP
2004
Springer
14 years 1 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...