Sciweavers

860 search results - page 129 / 172
» Biased Random Walks
Sort
View
JSAT
2008
122views more  JSAT 2008»
14 years 9 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
ACMICEC
2007
ACM
117views ECommerce» more  ACMICEC 2007»
15 years 1 months ago
Selectively acquiring ratings for product recommendation
Accurate prediction of customer preferences on products is the key to any recommender systems to realize its promised strategic values such as improved customer satisfaction and t...
Zan Huang
ECAI
2008
Springer
14 years 11 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo
CVPR
2009
IEEE
16 years 3 months ago
Tracking of Cell Populations to Understand their Spatio-Temporal Behavior in Response to Physical Stimuli
We have developed methods for segmentation and tracking of cells in time-lapse phase-contrast microscopy images. Our multi-object Bayesian algorithm detects and tracks large num...
David House, Matthew Walker, Zheng Wu, Joyce Wong,...
CVPR
2004
IEEE
15 years 11 months ago
Shape Representation and Classification Using the Poisson Equation
Silhouettes contain rich information about the shape of objects that can be used for recognition and classification. We present a novel approach that allows us to reliably compute...
Lena Gorelick, Meirav Galun, Eitan Sharon, Ronen B...