3875 search results - page 626 / 775 » Approximation algorithms for the 0-extension problem |
152
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...
204
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
201
click to vote
SIGIR
2012
ACM
13 years 8 months ago
2012
ACM
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
156
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
147
click to vote
ICCAD
2003
IEEE
16 years 2 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...