599 search results - page 69 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
DASFAA
2010
IEEE
15 years 2 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
AOSD
2006
ACM
15 years 3 months ago
2006
ACM
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
103
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...