2950 search results - page 370 / 590 » Computing with Infinitely Many Processes |
215
click to vote
IPPS
2007
IEEE
16 years 24 days 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...
198
click to vote
SAC
2006
ACM
16 years 14 days ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
176
click to vote
ACSC
2003
IEEE
15 years 11 months ago
2003
IEEE
In mobile computing environments, as a result of the reduced capacity of local storage, it is commonly not feasible to replicate entire datasets on each mobile unit. In addition, ...
199
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
The availability of digital imagers inside hospitals and their ever growing inspection capabilities have established digital medical images as a key component of many pathologies ...
176
click to vote
JAL
2006
15 years 6 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...