Sciweavers

108 search results - page 9 / 22
» Maximal Intersection Queries in Randomized Graph Models
Sort
View
ML
2010
ACM
141views Machine Learning» more  ML 2010»
14 years 8 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
ACST
2006
14 years 11 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
DAGM
2006
Springer
15 years 1 months ago
Near Real-Time Motion Segmentation Using Graph Cuts
We present a new approach to integrated motion estimation and segmentation by combining methods from discrete and continuous optimization. The velocity of each of a set of regions ...
Thomas Schoenemann, Daniel Cremers
MICCAI
2010
Springer
14 years 8 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
CIKM
2008
Springer
14 years 11 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis