Sciweavers

1032 search results - page 165 / 207
» A Category of Explicit Fusions
Sort
View
SPAA
2009
ACM
16 years 13 days ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 13 days ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
16 years 13 days ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
ICAC
2009
IEEE
16 years 12 days ago
Resilient workload manager: taming bursty workload of scaling internet applications
In data centers hosting scaling Internet applications, operators face the tradeoff dilemma between resource efficiency and Quality of Service (QoS), and the root cause lies in wo...
Hui Zhang 0002, Guofei Jiang, Kenji Yoshihira, Hai...
CIKM
2009
Springer
16 years 7 days ago
Using multiple ontologies in information extraction
Ontology-Based Information Extraction (OBIE) has recently emerged as a subfield of Information Extraction (IE). Here, ontologies - which provide formal and explicit specificatio...
Daya C. Wimalasuriya, Dejing Dou