Sciweavers

359 search results - page 68 / 72
» Order Scheduling Models: Hardness and Algorithms
Sort
View
INLG
2004
Springer
14 years 1 months ago
Resolving Structural Ambiguity in Generated Speech
Ambiguity in the output is a concern for NLG in general. This paper considers the case of structural ambiguity in spoken language generation. We present an algorithm which inserts ...
Chris Mellish
MIR
2003
ACM
174views Multimedia» more  MIR 2003»
14 years 26 days ago
Content-based image retrieval by clustering
In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high fea...
Yixin Chen, James Ze Wang, Robert Krovetz
MM
2003
ACM
146views Multimedia» more  MM 2003»
14 years 26 days ago
Supporting timeliness and accuracy in distributed real-time content-based video analysis
Real-time content-based access to live video data requires content analysis applications that are able to process the video data at least as fast as the video data is made availab...
Viktor S. Wold Eide, Frank Eliassen, Ole-Christoff...
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 26 days ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing