4131 search results - page 346 / 827 » The Generalized Max-Controlled Set Problem |
216
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
165
click to vote
WEA
2010
Springer
15 years 11 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...
124
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
Code libraries are characterized by feature-richness — and, consequently, high overhead. The library specialization problem is the problem of obtaining a low-overhead version of...
179
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—Robustness of optimization models for networking problems has been an under-explored area. Yet most existing algorithms for solving robust optimization problems are centralized,...
142
click to vote
BROADNETS
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...