Sciweavers

52 search results - page 4 / 11
» dcg 2010
Sort
View
WSDM
2010
ACM
197views Data Mining» more  WSDM 2010»
14 years 2 months ago
Beyond DCG: user behavior as a predictor of a successful search
Web search engines are traditionally evaluated in terms of the relevance of web pages to individual queries. However, relevance of web pages does not tell the complete picture, si...
Ahmed Hassan, Rosie Jones, Kristina Lisa Klinkner
DCG
2010
75views more  DCG 2010»
13 years 7 months ago
Star Unfolding Convex Polyhedra via Quasigeodesic Loops
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
DCG
2010
135views more  DCG 2010»
13 years 7 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
DCG
2010
61views more  DCG 2010»
13 years 7 months ago
Vertex Numbers of Weighted Faces in Poisson Hyperplane Mosaics
In the random mosaic generated by a stationary Poisson hyperplane process in Rd , we consider the typical k-face weighted by the j-dimensional volume of the j-skeleton (0 j k d)...
Rolf Schneider
DCG
2010
91views more  DCG 2010»
13 years 7 months ago
The Contact Polytope of the Leech Lattice
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we reveal the face structure of the contact polytope of the Leech lattice. We classify i...
Mathieu Dutour Sikiric, Achill Schürmann, Fra...