7930 search results - page 367 / 1586 » Greedy in Approximation Algorithms |
171
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
241
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
206
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
187
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
171
click to vote
INFOCOM
2005
IEEE
16 years 9 days ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...