1538 search results - page 262 / 308 » Spectral Techniques in Graph Algorithms |
125
click to vote
CORR
2008
Springer
15 years 1 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...
232
click to vote
ICDE
2002
IEEE
16 years 2 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
116
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
ICCAD
2008
IEEE
15 years 10 months ago
2008
IEEE
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
130
click to vote
WEA
2010
Springer
15 years 8 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...