Sciweavers

178 search results - page 24 / 36
» Computing Longest Previous Factor in linear time and applica...
Sort
View
SIGCSE
2009
ACM
161views Education» more  SIGCSE 2009»
14 years 1 months ago
An activity-based sensor networks course for undergraduates with sun spot devices
Wireless sensor networks are revolutionizing the instrumentation of the physical world, across scientific, industrial and military applications. In this paper, we describe our eff...
Damon Tyman, Nirupama Bulusu, Jens Mache
CF
2005
ACM
13 years 10 months ago
Reducing misspeculation overhead for module-level speculative execution
Thread-level speculative execution is a technique that makes it possible for a wider range of single-threaded applications to make use of the processing resources in a chip multip...
Fredrik Warg, Per Stenström
EUROPAR
2004
Springer
14 years 6 days ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
ICASSP
2010
IEEE
13 years 8 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
ICML
2010
IEEE
13 years 9 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun