Sciweavers

920 search results - page 11 / 184
» How Complex is Discourse Structure
Sort
View
AUSAI
2008
Springer
15 years 4 months ago
Exploiting Ontological Structure for Complex Preference Assembly
When a user is looking for a product recommendation they usually lack expert knowledge regarding the items they are looking for. Ontologies on the other hand are crafted by experts...
Gil Chamiel, Maurice Pagnucco
COLT
2001
Springer
15 years 6 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
IJSEKE
2002
95views more  IJSEKE 2002»
15 years 1 months ago
A Multimedia Model Based on Structured Media and Sub-Elements for Complex Multimedia Authoring and Presentation
through the specification of temporal, spatial and spatio-temporal relations. Moreover, we propose an abstract animation model that can be combined with the intra-media temporal st...
Tran-Thuong Tien, Cécile Roisin
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 2 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
ANTSW
2004
Springer
15 years 7 months ago
How to Use Ants for Hierarchical Clustering
Abstract. We present in this paper, a new model for document hierarchical clustering, which is inspired from the self-assembly behavior of real ants. We have simulated the way ants...
Hanene Azzag, Christiane Guinot, Gilles Venturini