Sciweavers

153 search results - page 16 / 31
» An Empirical Analysis of Approximation Algorithms for Euclid...
Sort
View
ICDAR
2011
IEEE
12 years 7 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 7 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
IR
2010
13 years 6 months ago
A general approximation framework for direct optimization of information retrieval measures
Recently direct optimization of information retrieval (IR) measures becomes a new trend in learning to rank. Several methods have been proposed and the effectiveness of them has ...
Tao Qin, Tie-Yan Liu, Hang Li
ICALP
2009
Springer
14 years 7 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ICML
2008
IEEE
14 years 8 months ago
Training structural SVMs when exact inference is intractable
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
Thomas Finley, Thorsten Joachims