EUROGP
2009
Springer
13 years 7 months ago
2009
Springer
We have created a real-time evolutionary object recognition system. Genetic Programming is used to automatically search the space of possible computer vision programs guided throug...
EMNLP
2009
13 years 7 months ago
2009
The recently introduced online confidence-weighted (CW) learning algorithm for binary classification performs well on many binary NLP tasks. However, for multi-class problems CW l...
EGH
2009
Springer
13 years 7 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
EGH
2009
Springer
13 years 7 months ago
2009
Springer
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. We design and analyze the costs of three alternative data-parallel algorithms for ra...
EGH
2009
Springer
13 years 7 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
ECRTS
2009
IEEE
13 years 7 months ago
2009
IEEE
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept o...
ECRTS
2009
IEEE
13 years 7 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
DPHOTO
2009
13 years 7 months ago
2009
The lifetime of solid-state image sensors is limited by the appearance of defects, particularly hot-pixels, which we have previously shown to develop continuously over the sensor ...
DMIN
2009
13 years 7 months ago
2009
- Over the last twenty years, text classification has become one of the key techniques for organizing electronic information such as text and web documents. The k-Nearest Neighbor ...
CORR
2009
Springer
13 years 7 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...