Sciweavers

656 search results - page 55 / 132
» Minimal non-convex words
Sort
View
IPL
2010
114views more  IPL 2010»
14 years 8 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
JMIV
2010
91views more  JMIV 2010»
14 years 8 months ago
Topological Properties of Thinning in 2-D Pseudomanifolds
Preserving topological properties of objects during thinning procedures is an important issue in the field of image analysis. In the case of 2-D digital images (i.e. images defi...
Nicolas Passat, Michel Couprie, Loïc Mazo, Gi...
MOR
2010
108views more  MOR 2010»
14 years 8 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
KDD
2007
ACM
206views Data Mining» more  KDD 2007»
15 years 10 months ago
Automatic labeling of multinomial topic models
Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic models to any text mining proble...
Qiaozhu Mei, Xuehua Shen, ChengXiang Zhai
ACL
1998
14 years 11 months ago
Dialogue Act Tagging with Transformation-Based Learning
For the task of recognizing dialogue acts, we are applying the Transformation-Based Learning (TBL) machine learning algorithm. To circumvent a sparse data problem, we extract valu...
Ken Samuel, Sandra Carberry, K. Vijay-Shanker