Sciweavers

3818 search results - page 592 / 764
» Learning from Order Examples
Sort
View
TSD
2007
Springer
16 years 16 days ago
Logic-Based Rhetorical Structuring for Natural Language Generation in Human-Computer Dialogue
Abstract. Rhetorical structuring is field approached mostly by research in natural language (pragmatic) interpretation. However, in natural language generation (NLG) the rhetorica...
Vladimir Popescu, Jean Caelen, Corneliu Burileanu
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 12 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
BIRTHDAY
2010
Springer
15 years 7 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Connectivity in Sub-Poisson Networks
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
Bartlomiej Blaszczyszyn, D. Yogeshwaran
RSA
2010
107views more  RSA 2010»
15 years 4 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou