Sciweavers

1523 search results - page 142 / 305
» The Computational Complexity of Linear Optics
Sort
View
SIAMNUM
2011
139views more  SIAMNUM 2011»
13 years 5 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
CVPR
2007
IEEE
15 years 5 days ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 5 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
CVPR
2010
IEEE
14 years 6 months ago
Use Bin-Ratio Information for Category and Scene Classification
In this paper we propose using bin-ratio information, which is collected from the ratios between bin values of histograms, for scene and category classification. To use such info...
Nianhua Xie, Haibin Ling, Weiming Hu, Xiaoqin Zhan...
ACMSE
2009
ACM
14 years 4 months ago
Bit vector algorithms enabling high-speed and memory-efficient firewall blacklisting
In a world of increasing Internet connectivity coupled with increasing computer security risks, security conscious network applications implementing blacklisting technology are be...
J. Lane Thames, Randal Abler, David Keeling