Sciweavers

741 search results - page 112 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
TON
2010
138views more  TON 2010»
14 years 8 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng
NIPS
2007
15 years 3 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
CGF
2007
98views more  CGF 2007»
15 years 1 months ago
Distance-Ranked Connectivity Compression of Triangle Meshes
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
Patrick Marais, James E. Gain, D. Shreiner
MICRO
2009
IEEE
133views Hardware» more  MICRO 2009»
15 years 8 months ago
A tagless coherence directory
A key challenge in architecting a CMP with many cores is maintaining cache coherence in an efficient manner. Directory-based protocols avoid the bandwidth overhead of snoop-based ...
Jason Zebchuk, Vijayalakshmi Srinivasan, Moinuddin...
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
13 years 9 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle