3946 search results - page 349 / 790 » The computational complexity of choice sets |
200
click to vote
ESA
2005
Springer
16 years 11 days ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
195
click to vote
MFCS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
189
click to vote
3DPVT
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
162
click to vote
NDSS
2008
IEEE
16 years 1 months ago
2008
IEEE
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
225
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...