Sciweavers

1142 search results - page 73 / 229
» Approximability of Clausal Constraints
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 6 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...
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
16 years 28 days ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
EACL
2010
ACL Anthology
15 years 7 months ago
Generating Approximate Geographic Descriptions
Georeferenced data sets are often large and complex. Natural Language Generation (NLG) systems are beginning to emerge that generate texts from such data. One of the challenges th...
Ross Turner, Somayajulu Sripada, Ehud Reiter
DAGSTUHL
2007
15 years 7 months ago
Nonlinear Approximation and Image Representation using Wavelets
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
Sudipto Guha, Boulos Harb
IJCAI
2003
15 years 7 months ago
Approximating Optimal Policies for Agents with Limited Execution Resources
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
Dmitri A. Dolgov, Edmund H. Durfee