4218 search results - page 68 / 844 » Complete sets of cooperations |
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
DNA
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. For robust molecular implementation of tile-based algorithmic self-assembly, methods for reducing errors must be developed. Previous studies suggested that by control of ...
ADMI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study the problem of predictive data mining in the competitive multi-agent setting, in which each agent is assumed to have some partial knowledge needed for correctly ...
CVPR
2005
IEEE
13 years 9 months ago
2005
IEEE
A novel two-stage level set evolution method for detecting man-made objects in aerial images is described. The method is based on a modified Mumford-Shah model and it uses a two-s...
BCSHCI
2008
13 years 9 months ago
2008
My dissertation work focuses on the motivation for adopting emergency response technology in community settings. The main purpose of my study is to understand various factors that...