Sciweavers

574 search results - page 58 / 115
» Maximum Margin Clustering
Sort
View
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 1 days ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
SAC
2009
ACM
14 years 2 months ago
Parameterless outlier detection in data streams
Outlyingness is a subjective concept relying on the isolation level of a (set of) record(s). Clustering-based outlier detection is a field that aims to cluster data and to detect...
Alice Marascu, Florent Masseglia
DATE
2008
IEEE
117views Hardware» more  DATE 2008»
14 years 2 months ago
A Scalable Algorithmic Framework for Row-Based Power-Gating
Leakage power is a serious concern in nanometer CMOS technologies. In this paper we focus on leakage reduction through automatic insertion of sleep transistors for power gating in...
Ashoka Visweswara Sathanur, Antonio Pullini, Luca ...
ICML
2005
IEEE
14 years 8 months ago
Naive Bayes models for probability estimation
Naive Bayes models have been widely used for clustering and classification. However, they are seldom used for general probabilistic learning and inference (i.e., for estimating an...
Daniel Lowd, Pedro Domingos
HICSS
2007
IEEE
112views Biometrics» more  HICSS 2007»
14 years 2 months ago
Hardware-Assisted Scanning for Signature Patterns in Image File Fragments
The ability to detect fragments of deleted image files and to reconstruct these image files from all available fragments on disk is an important activity in the field of digital f...
Yoginder S. Dandass