Sciweavers

4781 search results - page 946 / 957
» Complexity at large
Sort
View
ALGORITHMICA
2011
13 years 2 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
ACSC
2010
IEEE
13 years 2 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche
BMCBI
2011
13 years 2 months ago
Predicting functionally important SNP classes based on negative selection
Background: With the advent of cost-effective genotyping technologies, genome-wide association studies allow researchers to examine hundreds of thousands of single nucleotide poly...
Mark A. Levenstien, Robert J. Klein
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
IJMMS
2011
104views more  IJMMS 2011»
13 years 2 months ago
Revisiting path steering for 3D manipulation tasks
The law of path steering, as proposed by Accot and Zhai, describes a quantitative relationship between human temporal performance and the path’s spatial characteristics. The ste...
Lei Liu, Jean-Bernard Martens, Robert van Liere