PR
2011
13 years 1 months ago
2011
In this paper we propose a novel approach to content-based image retrieval with relevance feedback, which is based on the random walker algorithm introduced in the context of inte...
PR
2011
13 years 1 months ago
2011
Increasingly large amount of multidimensional data are being generated on a daily basis in many applications. This leads to a strong demand for learning algorithms to extract usef...
PR
2011
13 years 1 months ago
2011
In the field of multimedia retrieval in video, text frame classification is essential for text detection, event detection, event boundary detection etc. We propose a new text fram...
PR
2011
13 years 1 months ago
2011
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempo...
PPOPP
2011
ACM
13 years 1 months ago
2011
ACM
Time skewing and loop tiling has been known for a long time to be a highly beneficial acceleration technique for nested loops especially on bandwidth hungry multi-core processors...
PPOPP
2011
ACM
13 years 1 months ago
2011
ACM
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
PPOPP
2011
ACM
13 years 1 months ago
2011
ACM
Developing parallel software using current tools can be challenging. Even experts find it difficult to reason about the use of locks and often accidentally introduce race condit...
PPOPP
2011
ACM
13 years 1 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
PPOPP
2011
ACM
13 years 1 months ago
2011
ACM
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
PPOPP
2011
ACM
13 years 1 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...