Sciweavers

1736 search results - page 197 / 348
» On antimagic directed graphs
Sort
View
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
15 years 4 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
FLAIRS
2003
15 years 7 months ago
Spatially-Aware Information Retrieval with Graph-Based Qualitative Reference Models
Geo-referenced information is used by a growing number of “spatially-aware” tools in different application areas, including tourism, marketing, environmental management, and m...
Thomas Vögele, Christoph Schlieder
TC
2010
15 years 4 months ago
A Novel Weighted-Graph-Based Grouping Algorithm for Metadata Prefetching
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...
Peng Gu, Jun Wang, Yifeng Zhu, Hong Jiang, Pengju ...
CORR
2007
Springer
131views Education» more  CORR 2007»
15 years 6 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 10 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali