Sciweavers

53 search results - page 10 / 11
» On the Reduction Theory for Average Case Complexity
Sort
View
TFCV
1994
13 years 10 months ago
Attentive Visual Motion Processing: Computations in the Log-Polar Plane
Attentive vision is characterized by selective sensing in space and time as well as selective processing with respect to a speci c task. Selection in space involves the splitting ...
Konstantinos Daniilidis
CASES
2006
ACM
14 years 2 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
CGO
2008
IEEE
14 years 3 months ago
Latency-tolerant software pipelining in a production compiler
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 9 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 9 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...