Sciweavers

2721 search results - page 182 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
CPM
2006
Springer
140views Combinatorics» more  CPM 2006»
15 years 1 months ago
Identifying Co-referential Names Across Large Corpora
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...
Levon Lloyd, Andrew Mehler, Steven Skiena
ECCV
2008
Springer
14 years 11 months ago
Discriminative Locality Alignment
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
Tianhao Zhang, Dacheng Tao, Jie Yang
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
14 years 7 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
EDBT
2011
ACM
225views Database» more  EDBT 2011»
14 years 1 months ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
ICDAR
2011
IEEE
13 years 9 months ago
Tuning between Exponential Functions and Zones for Membership Functions Selection in Voronoi-Based Zoning for Handwritten Charac
— In Handwritten Character Recognition, zoning is rigtly considered as one of the most effective feature extraction techniques. In the past, many zoning methods have been propose...
Sebastiano Impedovo, Giuseppe Pirlo