Sciweavers

2157 search results - page 378 / 432
» Optimal Fast Hashing
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
INFOCOM
2010
IEEE
14 years 10 months ago
Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes
Abstract—Distributed storage systems provide large-scale reliable data storage by storing a certain degree of redundancy in a decentralized fashion on a group of storage nodes. T...
Jun Li, Shuang Yang, Xin Wang, Baochun Li
JSW
2010
83views more  JSW 2010»
14 years 10 months ago
Estimating Model Parameters of Conditioned Soils by using Artificial Network
—The parameter identification of nonlinear constitutive model of soil mass is based on an inverse analysis procedure, which consists of minimizing the objective function represen...
Zichang Shangguan, Shouju Li, Wei Sun, Maotian Lua...
TIP
2010
127views more  TIP 2010»
14 years 10 months ago
Bayesian Compressive Sensing Using Laplace Priors
In this paper we model the components of the compressive sensing (CS) problem, i.e., the signal acquisition process, the unknown signal coefficients and the model parameters for ...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
TON
2010
118views more  TON 2010»
14 years 10 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho