2421 search results - page 259 / 485 » Approximate Flow-Aware Networking |
231
click to vote
VLDB
2006
ACM
16 years 4 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
164
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
121
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Abstract. Streaming environments typically dictate incomplete or approximate algorithm execution, in order to cope with sudden surges in the data rate. Such limitations are even mo...
112
click to vote
ICCAD
2006
IEEE
16 years 29 days ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
119
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present a waveform based variational static timing analysis methodology. It is a timing paradigm that lies midway between convention static delay approximations and full dyn...