2254 search results - page 150 / 451 » Computing the minimal covering set |
200
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
196
click to vote
DEBS
2009
ACM
15 years 10 months ago
2009
ACM
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
181
click to vote
CCIA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we propose the construction of a visual content layer which describes the visual appearance of geographic locations in a city. We captured, by means of a Mobile Mappi...
191
click to vote
COLING
2010
15 years 1 months ago
2010
Multi-document summarization aims to produce a concise summary that contains salient information from a set of source documents. In this field, sentence ranking has hitherto been ...
186
click to vote
NETWORKS
2011
15 years 1 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...