Sciweavers

19700 search results - page 24 / 3940
» DNA-Based Computation Times
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
AINA
2010
IEEE
13 years 5 months ago
Neural Network Trainer through Computer Networks
- This paper introduces a neural network training tool through computer networks. The following algorithms, such as neuron by neuron (NBN) [1][2], error back propagation (EBP), Lev...
Nam Pham, Hao Yu, Bogdan M. Wilamowski
VLUDS
2010
212views Visualization» more  VLUDS 2010»
13 years 3 months ago
Open Problems in Computational Steering of Massive Parallel Unstructured Grid Based CFD Simulations
Traditionally, analysis of flow fields resulting from computational fluid dynamics (CFD) calculations is a sequential process. The flow area defined by surrounding geometry is tes...
Christian Wagner
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 8 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
ICPP
2009
IEEE
13 years 6 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun