Sciweavers

5100 search results - page 675 / 1020
» The Linear Complexity of a Graph
Sort
View
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
15 years 8 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 6 months ago
Fishing in Poisson streams: focusing on the whales, ignoring the minnows
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
Maxim Raginsky, Sina Jafarpour, Rebecca Willett, A...
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
DCG
2010
171views more  DCG 2010»
15 years 6 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
CORR
2007
Springer
121views Education» more  CORR 2007»
15 years 6 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signiï...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...