Sciweavers

1949 search results - page 378 / 390
» Random graphs on surfaces
Sort
View
CIKM
2009
Springer
14 years 2 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
BIBE
2007
IEEE
195views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Finding Clusters of Positive and Negative Coregulated Genes in Gene Expression Data
— In this paper, we propose a system for finding partial positive and negative coregulated gene clusters in microarray data. Genes are clustered together if they show the same p...
Kerstin Koch, Stefan Schönauer, Ivy Jansen, J...
ICDAR
2007
IEEE
14 years 1 months ago
Energy-Based Models in Document Recognition and Computer Vision
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
Yann LeCun, Sumit Chopra, Marc'Aurelio Ranzato, Fu...
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
14 years 1 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 1 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim