740 search results - page 57 / 148 » An approximation ratio for biclustering |
170
click to vote
DAM
2010
15 years 6 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
188
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We present a novel discriminative-generative hybrid approach in this paper, with emphasis on application in multiview object detection. Our method includes a novel generative mode...
177
click to vote
STRINGOLOGY
2004
15 years 8 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
185
click to vote
ICALP
2005
Springer
16 years 9 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
189
click to vote
SSD
2005
Springer
16 years 8 days ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...