Sciweavers

4266 search results - page 461 / 854
» The container loading problem
Sort
View
JCT
2007
90views more  JCT 2007»
15 years 6 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
CG
2005
Springer
15 years 6 months ago
A polar-plane-based method for natural illumination of plants and trees
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...
Maria J. Vicent, Vicente Rosell, Roberto Viv&oacut...
168
Voted
ASC
2004
15 years 6 months ago
Clustering terms in the Bayesian network retrieval model: a new approach with two term-layers
The retrieval performance of an information retrieval system usually increases when it uses the relationships among the terms contained in a given document collection. However, th...
Luis M. de Campos, Juan M. Fernández-Luna, ...
BSL
2000
153views more  BSL 2000»
15 years 6 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
148
Voted
CORR
2000
Springer
100views Education» more  CORR 2000»
15 years 6 months ago
Boosting Applied to Word Sense Disambiguation
In this paper Schapire and Singer's AdaBoost.MH boosting algorithm is applied to the Word Sense Disambiguation (WSD) problem. Initial experiments on a set of 15 selected polys...
Gerard Escudero, Lluís Màrquez, Germ...