Sciweavers

3211 search results - page 227 / 643
» On the Grundy Number of a Graph
Sort
View
DCG
2010
80views more  DCG 2010»
15 years 6 months ago
Geometry of Configuration Spaces of Tensegrities
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in Rd to admit a non-zero self stress with underlying graph G. We introduce...
Franck Doray, Oleg Karpenkov, Jan Schepers
CORR
2007
Springer
87views Education» more  CORR 2007»
15 years 6 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami
ML
2008
ACM
146views Machine Learning» more  ML 2008»
15 years 6 months ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
CAGD
2000
61views more  CAGD 2000»
15 years 6 months ago
Efficient evaluation of triangular B-spline surfaces
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
Michael Franssen, Remco C. Veltkamp, Wieger Wessel...
PC
2000
93views Management» more  PC 2000»
15 years 6 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet