Sciweavers

172 search results - page 24 / 35
» Approximate low-rank factorization with structured factors
Sort
View
ICALP
2004
Springer
14 years 26 days ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 2 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
TSP
2008
119views more  TSP 2008»
13 years 7 months ago
The Shiftable Complex Directional Pyramid - Part II: Implementation and Applications
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
Truong T. Nguyen, Soontorn Oraintara
ESOP
2011
Springer
12 years 11 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
EMMCVPR
2011
Springer
12 years 7 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko