Sciweavers

380 search results - page 48 / 76
» Generalizing foraging theory for analysis and design
Sort
View
LCTRTS
2010
Springer
15 years 4 months ago
Cache vulnerability equations for protecting data in embedded processor caches from soft errors
Continuous technology scaling has brought us to a point, where transistors have become extremely susceptible to cosmic radiation strikes, or soft errors. Inside the processor, cac...
Aviral Shrivastava, Jongeun Lee, Reiley Jeyapaul
PODC
2009
ACM
16 years 10 days ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 2 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
EXPCS
2007
15 years 1 months ago
Pipeline spectroscopy
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...
MM
2006
ACM
203views Multimedia» more  MM 2006»
15 years 5 months ago
Learning image manifolds by semantic subspace projection
In many image retrieval applications, the mapping between highlevel semantic concept and low-level features is obtained through a learning process. Traditional approaches often as...
Jie Yu, Qi Tian