2485 search results - page 188 / 497 » Time Bounded Frequency Computations |
169
click to vote
FOCS
2009
IEEE
16 years 1 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...
129
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
157
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
Abstract We observe that the switching activity at a circuit node, also called the transition density, can be extremely sensitive to the circuit internal delays. As a result, sligh...
179
click to vote
RT
1995
Springer
15 years 10 months ago
1995
Springer
Reconstruction is imperative whenever an image or a volume needs to be resampled as a result of an affine or perspective transformation, texture mapping, or volume rendering. We p...
206
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...