583 search results - page 71 / 117 » New algorithms for efficient parallel string comparison |
156
Voted
SBACPAD
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel compu...
144
Voted
EGH
2010
Springer
15 years 18 days ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
124
Voted
ICDCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
166
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
224
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...