Sciweavers

733 search results - page 109 / 147
» Recommending 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
IPPS
2002
IEEE
15 years 2 months ago
A Prediction-Based Real-Time Scheduling Advisor
The real-time scheduling advisor (RTSA) is an entirely userlevel system that an application running on a typical shared, unreserved distributed computing environment can turn to f...
Peter A. Dinda
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...
71
Voted
ICCV
2007
IEEE
15 years 11 months ago
Untangling Cycles for Contour Grouping
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
Qihui Zhu, Gang Song, Jianbo Shi