201 search results - page 25 / 41 » Memory Optimizations For Fast Power-Aware Sparse Computation... |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
EWSN
2007
Springer
14 years 10 months ago
2007
Springer
While a multithreading approach provides a convenient sensor application developing environment with automatic control flow and stack managment, it is considered to have a larger d...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper, we present results and experiments with several methods for bundle adjustment, producing the fastest bundle adjuster ever published. The fastest methods work with t...
AI
2002
Springer
13 years 10 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...