Sciweavers

68 search results - page 10 / 14
» Axiomatization of an exponential similarity function
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
CVPR
2010
IEEE
14 years 3 months ago
SVM for Edge-Preserving Filtering
In this paper, we propose a new method to construct an edge-preserving filter which has very similar response to the bilateral filter. The bilateral filter is a normalized convolu...
Qingxiong Yang, Shengnan Wang, Narendra Ahuja
CP
2001
Springer
13 years 12 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
BMCBI
2006
144views more  BMCBI 2006»
13 years 7 months ago
Association algorithm to mine the rules that govern enzyme definition and to classify protein sequences
Background: The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation...
Shih-Hau Chiu, Chien-Chi Chen, Gwo-Fang Yuan, Thy-...
BMCBI
2004
158views more  BMCBI 2004»
13 years 7 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...