Sciweavers

1068 search results - page 192 / 214
» Fast and robust bootstrap
Sort
View
FAST
2010
14 years 5 days ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
FAST
2008
14 years 5 days ago
SWEEPER: An Efficient Disaster Recovery Point Identification Mechanism
Data corruption is one of the key problems that is on top of the radar screen of most CIOs. Continuous Data Protection (CDP) technologies help enterprises deal with data corruptio...
Akshat Verma, Kaladhar Voruganti, Ramani Routray, ...
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
ESANN
2006
13 years 11 months ago
Magnification control for batch neural gas
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
Barbara Hammer, Alexander Hasenfuss, Thomas Villma...
CAD
2006
Springer
13 years 10 months ago
On visual similarity based 2D drawing retrieval
A large amount of 2D drawings have been produced in engineering fields. To reuse and share the available drawings efficiently, we propose two methods in this paper, namely 2.5D sp...
Jiantao Pu, Karthik Ramani