1532 search results - page 178 / 307 » Connection Relations in Mereotopology |
145
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
203
Voted
SPAA
2012
ACM
13 years 3 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
201
click to vote
PODS
2009
ACM
16 years 1 months ago
2009
ACM
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
104
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
122
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...