986 search results - page 106 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
125
Voted
ICASSP
2011
IEEE
14 years 7 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 ...
158
Voted
AAIM
2009
Springer
15 years 1 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
117
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
143
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
176
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...