4302 search results - page 526 / 861 » Index Pairs Algorithms |
189
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
184
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
148
click to vote
SIAMJO
2010
15 years 1 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
188
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
We presen t a multiview method for the computation of object shape and re ectance characteristics based on the integration of shape from shading (SFS) and stereo, for nonconstan t...