1729 search results - page 310 / 346 » Bound Graph Polysemy |
111
click to vote
LREC
2010
15 years 6 months ago
2010
The Semantic Web is facing the important challenge to maintain its promise of a real world-wide graph of interconnected resources. Unfortunately, while URIs almost guarantee a dir...
145
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
159
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
162
Voted
ALENEX
2009
15 years 5 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
137
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...