Sciweavers

5889 search results - page 936 / 1178
» Graph Layout Problems
Sort
View
CI
2011
110views more  CI 2011»
15 years 1 months ago
Experiences with planning for natural language generation
We investigate the application of modern planning techniques to domains arising from problems in natural language generation (NLG). In particular, we consider two novel NLGinspire...
Alexander Koller, Ronald P. A. Petrick
COLING
2010
15 years 1 months ago
Extracting and Ranking Product Features in Opinion Documents
An important task of opinion mining is to extract people's opinions on features of an entity. For example, the sentence, "I love the GPS function of Motorola Droid"...
Lei Zhang, Bing Liu, Suk Hwan Lim, Eamonn O'Brien-...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler
WWW
2008
ACM
16 years 7 months ago
Recommending questions using the mdl-based tree cut model
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
Yunbo Cao, Huizhong Duan, Chin-Yew Lin, Yong Yu, H...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi