4041 search results - page 718 / 809 » time 2009 |
132
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
130
click to vote
ICALP
2009
Springer
16 years 4 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...
152
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
220
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
214
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Entity Resolution (ER) is the problem of identifying which records in a database refer to the same real-world entity. An exhaustive ER process involves computing the similarities b...