Sciweavers

3341 search results - page 572 / 669
» On Bounded Queries and Approximation
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
14 years 9 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
IVC
2000
179views more  IVC 2000»
14 years 9 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
JCO
2000
116views more  JCO 2000»
14 years 9 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
SIAMCO
2000
71views more  SIAMCO 2000»
14 years 9 months ago
On a Perturbation Approach for the Analysis of Stochastic Tracking Algorithms
In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method ...
Rafik Aguech, Eric Moulines, Pierre Priouret
TCAD
1998
115views more  TCAD 1998»
14 years 9 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram