21324 search results - page 255 / 4265 » Making the case for computing |
152
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
123
click to vote
DAC
1995
ACM
15 years 7 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...
155
click to vote
STACS
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
108
Voted
BMVC
2001
15 years 6 months ago
2001
We describe the development of a vision system to detect natural events in a low-resolution image stream. The work involves the assessment of algorithmic design decisions to maxim...
133
click to vote
BIOCOMP
2006
15 years 5 months ago
2006
- Aligning specific sequences against other known sequences in a database is a central aspect of bioinformatics. New experimental data being added continuously to these databases n...