2192 search results - page 192 / 439 » Algorithms for Challenging Motif Problems |
151
click to vote
CCO
2001
Springer
15 years 9 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
144
click to vote
RFIDSEC
2010
15 years 3 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
151
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
206
Voted
PAMI
2010
15 years 3 months ago
2010
The notion of using context information for solving high-level vision and medical image segmentation problems has been increasingly realized in the field. However, how to learn a...
136
Voted
ICCAD
2005
IEEE
16 years 1 months ago
2005
IEEE
Heat dissipation is one of the most serious challenges in 3D IC designs. One effective way of reducing circuit temperature is to introduce thermal through-the-silicon (TTS) vias....