5889 search results - page 385 / 1178 » Graph Layout Problems |
145
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
161
click to vote
ISVC
2005
Springer
16 years 10 days ago
2005
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
167
click to vote
AMW
2010
15 years 8 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
230
click to vote
ECOOP
2001
Springer
15 years 11 months ago
2001
Springer
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
204
click to vote
PC
2010
15 years 5 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...