Sciweavers

2836 search results - page 228 / 568
» Parsing Algorithms and Metrics
Sort
View
COMPGEOM
2008
ACM
13 years 10 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
POPL
2006
ACM
14 years 8 months ago
The essence of command injection attacks in web applications
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
Zhendong Su, Gary Wassermann
ISMB
1997
13 years 9 months ago
Inferring Gene Structures in Genomic Sequences Using Pattern Recognition and Expressed Sequence Tags
Abstract.) Ying Xu, Richard J. MuraF, and Edward C. Uberbacher Computer Science and Mathematics Division and tLife Sciences Division Computational methods for gene identification ...
Ying Xu, Richard J. Mural, Edward C. Uberbacher
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
14 years 3 months ago
Measuring the Similarity of Geometric Graphs
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
ICANNGA
2009
Springer
130views Algorithms» more  ICANNGA 2009»
14 years 2 months ago
String Distances and Uniformities
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
David W. Pearson, Jean-Christophe Janodet