Sciweavers

3008 search results - page 315 / 602
» Independence in connected graphs
Sort
View
CORR
2011
Springer
139views Education» more  CORR 2011»
14 years 10 months ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
AIPS
2011
14 years 10 months ago
Where Ignoring Delete Lists Works, Part II: Causal Graphs
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
Joerg Hoffmann
KDD
2009
ACM
237views Data Mining» more  KDD 2009»
16 years 7 months ago
Exploring social tagging graph for web object classification
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
Zhijun Yin, Rui Li, Qiaozhu Mei, Jiawei Han
ISBI
2009
IEEE
16 years 1 months ago
Cell Tracking and Segmentation in Electron Microscopy Images Using Graph Cuts
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...
Huei-Fang Yang, Yoonsuck Choe
IJCAI
2007
15 years 8 months ago
Web Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
Ron Bekkerman, Shlomo Zilberstein, James Allan