Sciweavers

4850 search results - page 645 / 970
» Approximate Data Structures with Applications
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
Attack-resistant frequency counting
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
Bo Wu, Jared Saia, Valerie King
TCOM
2011
155views more  TCOM 2011»
15 years 1 months ago
Asymptotically Optimal Model Estimation for Quantization
—Using high-rate theory approximations we introduce flexible practical quantizers based on possibly non-Gaussian models in both the constrained resolution (CR) and the constrain...
Alexey Ozerov, W. Bastiaan Kleijn
CVPR
2011
IEEE
14 years 10 months ago
Compact Hashing with Joint Optimization of Search Accuracy and Time
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
Junfeng He, Regunathan Radhakrishnan, Shih-Fu Chan...
EDUTAINMENT
2007
Springer
15 years 10 months ago
View-Dependent Hierarchical Foliage Simplification
High compression of plant geometry is an important aspect in fast realistic visualization of plants. Hierarchical structuring plant morphology is a key factor for real time plant r...
Qingqiong Deng, Xiaopeng Zhang, Marc Jaeger
JCC
2011
109views more  JCC 2011»
14 years 9 months ago
VoteDock: Consensus docking method for prediction of protein-ligand interactions
: Molecular recognition plays a fundamental role in all biological processes, and that is why great efforts have been made to understand and predict protein–ligand interactions. ...
Dariusz Plewczynski, Michal Lazniewski, Marcin von...