138 search results - page 5 / 28 » Hardness of fully dense problems |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
CIMCA
2006
IEEE
13 years 9 months ago
2006
IEEE
Existing Language Identification (LID) approaches do reach 100% precision, in most common situations, when dealing with documents written in just one language, and when those docu...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
In this study, we address the problem of 3-D dense metric reconstruction and registration from multiple images, given that the observed surface is nearly planar. This is difficult...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— A radio frequency identification (RFID) system consists of a set of readers and several objects, equipped with small computer chips, called tags. In a dense RFID system, where...