✦ LIBER ✦

Counting Integer Flows in Networks

✍ Scribed by W. Baldoni-Silva; J. A. De Loera; M. Vergne

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 445 KB
Volume: 4
Category: Article
ISSN: 1615-3375
DOI: 10.1007/s10208-003-0088-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bicriteria network flow problems: Intege

Bicriteria network flow problems: Integer case

✍ Haijune Lee; P. Simin Pulat 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 632 KB

Integer flows in network with fuzzy capa

Integer flows in network with fuzzy capacity constraints

✍ Stefan Chanas; Waldemar Kolodziejczyk 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 597 KB

The network equilibrium problem in integ

The network equilibrium problem in integers

✍ R. W. Rosenthal 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB

Maximum flows in probabilistic networks

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 868 KB

Output flows in queueing networks

✍ A. Rydel' 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 885 KB

Minimalist counting in sensor networks (

Minimalist counting in sensor networks (Noise helps)

✍ Y.M. Baryshnikov; E.G. Coffman; K.J. Kwak; Bill Moran 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 578 KB

We propose a novel algorithm for counting N indistinguishable objects, called targets, by a collection of sensors. We adopt a minimalist scenario where sensors are unaware of the (non-empty) intersections of sensing regions, and so simple addition of all sensor counts inflates estimates of the total