Sciweavers

6110 search results - page 467 / 1222
» Approximate Computing
Sort
View
STACS
2004
Springer
16 years 1 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
CHI
2008
ACM
16 years 8 months ago
Rapid image analysis using neural signals
The problem of extracting information from large collections of imagery is a challenge with few good solutions. Computers typically cannot interpret imagery as effectively as huma...
Santosh Mathan, Deniz Erdogmus, Yonghong Huang, Mi...
RECOMB
2003
Springer
16 years 8 months ago
Finding recurrent sources in sequences
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
Aristides Gionis, Heikki Mannila
PG
2007
IEEE
16 years 2 months ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien
ECCV
2010
Springer
16 years 2 days ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...