Sciweavers

7742 search results - page 226 / 1549
» The Robustness of Level Sets
Sort
View
ACS
2004
15 years 6 months ago
One Setting for All: Metric, Topology, Uniformity, Approach Structure
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
Maria Manuel Clementino, Dirk Hofmann, Walter Thol...
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
16 years 7 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
JUCS
2002
163views more  JUCS 2002»
15 years 6 months ago
Finding Plagiarisms among a Set of Programs with JPlag
: JPlag is a web service that finds pairs of similar programs among a given set of programs. It has successfully been used in practice for detecting plagiarisms among student Java ...
Lutz Prechelt, Guido Malpohl, Michael Philippsen
JMLR
2010
119views more  JMLR 2010»
15 years 1 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
14 years 6 months ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev