Sciweavers

6365 search results - page 871 / 1273
» Fast Local Computation Algorithms
Sort
View
ICDCS
1999
IEEE
15 years 11 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
242
Voted
VIS
2007
IEEE
239views Visualization» more  VIS 2007»
16 years 8 months ago
Moment Invariants for the Analysis of 2D Flow Fields
We present a novel approach for analyzing two-dimensional (2D) flow field data based on the idea of invariant moments. Moment invariants have traditionally been used in computer vi...
Michael Schlemmer, Manuel Heringer, Florian Morr...
186
Voted
BMCBI
2006
137views more  BMCBI 2006»
15 years 7 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
215
Voted
EGH
2009
Springer
15 years 5 months ago
Faster incoherent rays: Multi-BVH ray stream tracing
High fidelity rendering via ray tracing requires tracing incoherent rays for global illumination and other secondary effects. Recent research show that the performance benefits fr...
John A. Tsakok
261
Voted
TSP
2010
15 years 2 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat