Sciweavers

124 search results - page 23 / 25
» A generalization of weight polynomials to matroids
Sort
View
ORDER
2008
61views more  ORDER 2008»
14 years 9 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
ADCM
2004
74views more  ADCM 2004»
14 years 9 months ago
Extremal Systems of Points and Numerical Integration on the Sphere
This paper considers extremal systems of points on the unit sphere Sr Rr+1, related problems of numerical integration and geometrical properties of extremal systems. Extremal sys...
Ian H. Sloan, Robert S. Womersley
ICMLA
2009
14 years 7 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 4 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
SPAA
2006
ACM
15 years 3 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi