Sciweavers

2800 search results - page 558 / 560
» Introduction to Pattern Recognition
Sort
View
PAMI
2011
13 years 21 days ago
Matching Forensic Sketches to Mug Shot Photos
—The problem of matching a forensic sketch to a gallery of mug shot images is addressed in this paper. Previous research in sketch matching only offered solutions to matching hig...
Brendan Klare, Zhifeng Li, Anil K. Jain
TALG
2010
158views more  TALG 2010»
13 years 14 days ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
EDBT
2011
ACM
197views Database» more  EDBT 2011»
12 years 9 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 9 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
FOSSACS
2011
Springer
12 years 9 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman