248 search results - page 17 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
COMPUTING
2007
14 years 9 months ago
2007
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
A vector-sensor consisting of a monopole sensor collocated with orthogonally oriented dipole sensors can be used for direction-ofarrival (DOA) estimation. A method is proposed to ...
ESA
2007
Springer
15 years 3 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
WEA
2010
Springer
15 years 4 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...