14548 search results - page 2469 / 2910 » The Optimal Path-Matching Problem |
242
click to vote
MM
2009
ACM
15 years 11 months ago
2009
ACM
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
204
click to vote
CCO
2001
Springer
15 years 11 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...
205
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
203
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
179
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
Using the thermodynamics of DNA melting, a technique is proposed to choose a reaction temperature for the DNA computation that minimizes the potential for mishybridizations. Adlem...