Sciweavers

526 search results - page 3 / 106
» On the Number of Minimal Addition Chains
Sort
View
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 8 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
ECRTS
2006
IEEE
14 years 1 months ago
On a Theory of Media Processing Systems Behavior, with Applications
In this article we provide a model for the dynamic behavior of media processing chains of tasks communicating via bounded buffers. The aim is to find the overall behavior of a cha...
M. A. Weffers-Albu, Johan J. Lukkien, Elisabet F. ...
WSC
1998
13 years 8 months ago
Bayesian Model Selection when the Number of Components is Unknown
In simulation modeling and analysis, there are two situations where there is uncertainty about the number of parameters needed to specify a model. The first is in input modeling w...
Russell C. H. Cheng
ADHOCNOW
2004
Springer
14 years 26 days ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
ARSCOM
2007
115views more  ARSCOM 2007»
13 years 7 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf