Sciweavers

5829 search results - page 950 / 1166
» The Practice of Cluster Analysis
Sort
View
DCC
2005
IEEE
16 years 6 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICDT
2010
ACM
180views Database» more  ICDT 2010»
16 years 4 months ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
16 years 4 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
ICWS
2009
IEEE
16 years 4 months ago
Equivalence of Web Services in Process-Aware Service Compositions
Deciding on web service equivalence in process-aware service compositions is a crucial challenge throughout the composition life cycle. Restricting such decisions to (activity) la...
Stefanie Rinderle-Ma, Manfred Reichert, Martin Jur...