Sciweavers

1159 search results - page 34 / 232
» On relevance distributions
Sort
View
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
12 years 1 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
ESWS
2005
Springer
14 years 4 months ago
DRAGO: Distributed Reasoning Architecture for the Semantic Web
The paper addresses the problem of reasoning with multiple ontologies interrelated with semantic mappings. This problem is becoming more and more relevant due to the necessity of b...
Luciano Serafini, Andrei Tamilin
DGO
2007
192views Education» more  DGO 2007»
14 years 12 days ago
D-HOTM: distributed higher order text mining
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
William M. Pottenger
PODC
1996
ACM
14 years 3 months ago
Fundamental Challenges in Mobile Computing
This paper is an answer to the question: "What is unique and conceptually different about mobile computing?" The paper begins by describing a set of constraints intrinsi...
Mahadev Satyanarayanan
IPPS
2007
IEEE
14 years 5 months ago
A Framework for Experimental Validation and Performance Evaluation in Fault Tolerant Distributed System
Performing experimental evaluation of fault tolerant distributed systems is a complex and tedious task, and automating as much as possible of the execution and evaluation of exper...
Hein Meling