Sciweavers

877 search results - page 170 / 176
» How to Cover a Grammar
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 7 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
DT
2006
113views more  DT 2006»
13 years 7 months ago
A Platform-Based Taxonomy for ESL Design
the abstraction level at which designers express systems, enabling new levels of design reuse, and providing for design chain integration ool flows and abstraction levels. The purp...
Douglas Densmore, Roberto Passerone
MANSCI
2006
70views more  MANSCI 2006»
13 years 7 months ago
Modeling the "Pseudodeductible" in Insurance Claims Decisions
In many different managerial contexts, consumers "leave money on the table" by, for example, their failure to claim rebates, use available coupons, and so on. This proje...
Michael Braun, Peter S. Fader, Eric T. Bradlow, Ho...
FUIN
2007
108views more  FUIN 2007»
13 years 7 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou