Sciweavers

709 search results - page 103 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
15 years 4 months ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
ICALP
2007
Springer
15 years 4 months ago
Private Multiparty Sampling and Approximation of Vector Combinations
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecc...
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
15 years 4 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
PAIRING
2007
Springer
132views Cryptology» more  PAIRING 2007»
15 years 3 months ago
Instruction Set Extensions for Pairing-Based Cryptography
A series of recent algorithmic advances has delivered highly effective methods for pairing evaluation and parameter generation. However, the resulting multitude of options means m...
Tobias Vejda, Dan Page, Johann Großschä...
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
15 years 3 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled