Sciweavers

901 search results - page 36 / 181
» Analyzing linear mergers
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
15 years 11 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
IBPRIA
2007
Springer
15 years 5 months ago
Improving Piecewise-Linear Registration Through Mesh Optimization
Abstract. Piecewise-linear methods accomplish the registration by dividing the images in corresponding triangular patches, which are individually mapped through affine transformati...
Vicente Arévalo, Javier González
AAAI
2004
15 years 20 days ago
Distributed Representation of Syntactic Structure by Tensor Product Representation and Non-Linear Compression
Representing lexicons and sentences with the subsymbolic approach (using techniques such as Self Organizing Map (SOM) or Artificial Neural Network (ANN)) is a relatively new but i...
Heidi H. T. Yeung, Peter W. M. Tsang
BMCBI
2008
172views more  BMCBI 2008»
14 years 11 months ago
Classification of drug molecules considering their IC50 values using mixed-integer linear programming based hyper-boxes method
Background: A priori analysis of the activity of drugs on the target protein by computational approaches can be useful in narrowing down drug candidates for further experimental t...
Pelin Armutlu, Muhittin Emre Ozdemir, Fadime Ü...
CORR
2011
Springer
282views Education» more  CORR 2011»
14 years 6 months ago
Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
Stanley Osher, Yu Mao, Bin Dong, Wotao Yin