Sciweavers

1158 search results - page 189 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
IPL
2007
96views more  IPL 2007»
15 years 6 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...
FOCS
2008
IEEE
16 years 15 days ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
15 years 7 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
CVPR
2010
IEEE
16 years 2 months ago
A Steiner Tree approach to efficient object detection
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
Olga Russakovsky, Quoc Le, Andrew Ng
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 10 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov