3757 search results - page 271 / 752 » The overlap number of a graph |
179
click to vote
SIROCCO
2001
15 years 8 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
159
click to vote
DCG
2010
15 years 6 months ago
2010
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...
199
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
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...
165
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
129
click to vote
CAGD
2000
15 years 6 months ago
2000
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...