Sciweavers

702 search results - page 13 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
14 years 23 days ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
WWW
2005
ACM
14 years 9 months ago
Identifying link farm spam pages
With the increasing importance of search in guiding today's web traffic, more and more effort has been spent to create search engine spam. Since link analysis is one of the m...
Baoning Wu, Brian D. Davison
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 11 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 8 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
SCIA
2011
Springer
341views Image Analysis» more  SCIA 2011»
12 years 11 months ago
Interactive Image Segmentation Using Level Sets and Dempster-Shafer Theory of Evidence
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
Björn Scheuermann, Bodo Rosenhahn