4047 search results - page 720 / 810 » Some Properties and Some Problems on Set Functors |
138
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
145
click to vote
IMC
2009
ACM
15 years 11 months ago
2009
ACM
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
130
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach cons...
174
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
117
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We propose a packet sampling strategy called fixedperiod sampling, which selects at most one packet in every fixedlength period. Under the fixed-period sampling, the...