Sciweavers

686 search results - page 25 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
16 years 3 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...
146
Voted
IJSI
2008
156views more  IJSI 2008»
15 years 3 months ago
Co-Training by Committee: A Generalized Framework for Semi-Supervised Learning with Committees
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
Mohamed Farouk Abdel Hady, Friedhelm Schwenker
CODES
2005
IEEE
15 years 9 months ago
Improving superword level parallelism support in modern compilers
Multimedia vector instruction sets are becoming ubiquitous in most of the embedded systems used for multimedia, networking and communications. However, current compiler technology...
Christian Tenllado, Luis Piñuel, Manuel Pri...
EUROCAST
2005
Springer
166views Hardware» more  EUROCAST 2005»
15 years 9 months ago
A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register...
Dominik Jochinger, Franz Pichler
131
Voted
COMPGEOM
1993
ACM
15 years 7 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas