Sciweavers

1951 search results - page 245 / 391
» An algorithm for improving graph partitions
Sort
View
ICML
2008
IEEE
16 years 5 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
ICSE
1999
IEEE-ACM
15 years 9 months ago
Data Flow Analysis for Checking Properties of Concurrent Java Programs
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...
Gleb Naumovich, George S. Avrunin, Lori A. Clarke
ICDE
1999
IEEE
139views Database» more  ICDE 1999»
16 years 6 months ago
Clustering Large Datasets in Arbitrary Metric Spaces
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehr...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 5 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
160
Voted
SAC
2006
ACM
15 years 11 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi