103 search results - page 17 / 21 » Dynamic programming matching for large scale information ret... |
PPOPP
1999
ACM
13 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
APVIS
2010
13 years 8 months ago
2010
Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis h...
SIGIR
2005
ACM
14 years 28 days ago
2005
ACM
Collection selection has been a research issue for years. Typically, in related work, precomputed statistics are employed in order to estimate the expected result quality of each ...
KBSE
2006
IEEE
14 years 1 months ago
2006
IEEE
Program checking technology is now a mature technology, but is not yet used on a large scale. We identify one cause of this gap in the decoupling of checking tools from the everyd...
IMC
2009
ACM
14 years 1 months ago
2009
ACM
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...