8825 search results - page 1414 / 1765 » All for one or one for all |
100
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
183
click to vote
VLDB
2003
ACM
16 years 1 months ago
2003
ACM
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
198
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
182
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
181
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...