34 search results - page 4 / 7 » New Bounds for Motif Finding in Strong Instances |
AMAI
2004
Springer
14 years 22 days ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose an approach to overcome the two main challenges
of 3D multiview object detection and localization:
The variation of object features due to changes in the viewpoint
an...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...