6110 search results - page 176 / 1222 » Approximate Computing |
173
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
161
click to vote
PODS
2000
ACM
15 years 10 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
150
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
194
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
147
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...