Sciweavers

561 search results - page 95 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
14 years 2 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
WSCG
2000
117views more  WSCG 2000»
13 years 9 months ago
Solving Multiple Layer Containment Problems Using Iterative Methods
The footwear industry's need for an automatic containment algorithm is becoming increasingly important within the manufacturing process. Irregular containers, such as hides, ...
Nuno Marques, Pedro Capela, João Bernardo
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
Quadratic variance models for adaptively preprocessing SELDI-TOF mass spectrometry data
Background: Surface enhanced laser desorption/ionization time-of-flight mass spectrometry (SELDI) is a proteomics tool for biomarker discovery and other high throughput applicatio...
Vincent A. Emanuele II, Brian M. Gurbaxani
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter