Sciweavers

2127 search results - page 166 / 426
» Computing large matchings fast
Sort
View
INFOCOM
2005
IEEE
15 years 9 months ago
TCAM-based distributed parallel packet classification algorithm with range-matching solution
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
Kai Zheng, Hao Che, Zhijun Wang, Bin Liu
HIPEAC
2007
Springer
15 years 10 months ago
Branch History Matching: Branch Predictor Warmup for Sampled Simulation
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on todayâ€...
Simon Kluyskens, Lieven Eeckhout
PVM
2010
Springer
15 years 2 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
CVPR
2009
IEEE
16 years 8 months ago
Real-Time Learning of Accurate Patch Rectification
Recent work [5, 6] showed that learning-based patch rectification methods are both faster and more reliable than affine region methods. Unfortunately, their performance improveme...
Stefan Hinterstoisser, Oliver Kutter, Nassir Navab...
138
Voted
TIP
2008
169views more  TIP 2008»
15 years 4 months ago
Maximum Likelihood Wavelet Density Estimation With Applications to Image and Shape Matching
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
Adrian M. Peter, Anand Rangarajan