Sciweavers

484 search results - page 26 / 97
» Large graph processing in the cloud
Sort
View
ICML
2010
IEEE
15 years 4 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
NAACL
2007
15 years 4 months ago
Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
Andrei Alexandrescu, Katrin Kirchhoff
CEC
2005
IEEE
15 years 5 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers
WAIM
2010
Springer
15 years 1 months ago
HyperGraphDB: A Generalized Graph Database
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
Borislav Iordanov
OWLED
2007
15 years 4 months ago
Use of OWL for Describing Stream Processing Components to Enable Automatic Composition
Stream Processing Applications analyze large volumes of streaming data in real-time. These applications, consist of data sources, which produce raw streams, and processing elements...
Zhen Liu, Anand Ranganathan, Anton Riabov