Sciweavers

301 search results - page 24 / 61
» On Finding Dense Subgraphs
Sort
View
100
Voted
ECCV
2002
Springer
16 years 1 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
15 years 5 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
102
Voted
WWW
2011
ACM
14 years 6 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
CPAIOR
2008
Springer
15 years 1 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
DCOSS
2005
Springer
15 years 5 months ago
Infrastructure-Establishment from Scratch in Wireless Sensor Networks
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...
Stefan Funke, Nikola Milosavljevic