Search
Now showing items 91-100 of 104
A Quantitative Comparison of Reconfigurable, Tiled, and Conventional Architectures on Bit-level Computation
(2004-04-13)
General purpose computing architectures are being called on to work on amore diverse application mix every day. This has been fueled by the needfor reduced time to market and economies of scale that are the hallmarksof ...
Converting Java Programs to Use Generic Libraries
(2004-03-30)
Java 1.5 will include a type system (called JSR-14) that supports parametric polymorphism, or generic classes. This will bring many benefits to Java programmers, not least because current Java practice makes heavy use of ...
Long-Lived Rambo: Trading Knowledge for Communication
(2004-04-12)
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributedsystems easier. However, combining linearizability with efficiency in practical algorithms is difficult. ...
Contextual Influences on Saliency
(2004-04-14)
This article describes a model for including scene/context priors in attention guidance. In the proposed scheme, visual context information can be available early in the visual processing chain, in order to modulate the ...
A 1020-Node Modular Microphone Array and Beamformer for Intelligent Computing Spaces
(2004-04-14)
Ubiquitous computing environments are characterized by an unboundedamount of noise and crosstalk. In these environments, traditionalmethods of sound capture are insufficient, and array microphones areneeded in order to ...
On Generalized Records and Spatial Conjunction in Role Logic
(2004-04-06)
We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic ...
Cascading Regularized Classifiers
(2004-04-21)
Among the various methods to combine classifiers, Boosting was originally thought as an stratagem to cascade pairs of classifiers through their disagreement. I recover the same idea from the work of Niyogi et al. to show ...
Methods and Experiments With Bounded Tree-width Markov Networks
(2004-12-30)
Markov trees generalize naturally to bounded tree-width Markov networks, onwhich exact computations can still be done efficiently. However, learning themaximum likelihood Markov network with tree-width greater than 1 is ...
On Decision Procedures for Set-Value Fields
(2004-11-30)
An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ...
A general mechanism for tuning: Gain control circuits and synapses underlie tuning of cortical neurons
(2004-12-31)
Tuning to an optimal stimulus is a widespread property of neurons in cortex. We propose that such tuning is a consequence of normalization or gain control circuits. We also present a biologically plausible neural circuitry ...