Sciweavers

307 search results - page 6 / 62
» A Comparison of Algorithms for Connected Set Openings and Cl...
Sort
View
ASWC
2009
Springer
13 years 5 months ago
LODE: Linking Open Descriptions of Events
People conventionally refer to an action or occurrence taking place at a certain time at a specific location as an event. This notion is potentially useful for connecting individua...
Ryan Shaw, Raphaël Troncy, Lynda Hardman
INFOCOM
2011
IEEE
12 years 11 months ago
Scalable and fully distributed localization with mere connectivity
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu
TIP
2008
85views more  TIP 2008»
13 years 7 months ago
A Scale-Based Connected Coherence Tree Algorithm for Image Segmentation
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...
Jundi Ding, RuNing Ma, Songcan Chen
PAKDD
2007
ACM
128views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Selecting a Reduced Set for Building Sparse Support Vector Regression in the Primal
Recent work shows that Support vector machines (SVMs) can be solved efficiently in the primal. This paper follows this line of research and shows how to build sparse support vector...
Liefeng Bo, Ling Wang, Licheng Jiao
WWW
2010
ACM
14 years 2 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney