Sciweavers

ACIVS
2007
Springer
14 years 5 months ago
Joint Tracking and Segmentation of Objects Using Graph Cuts
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
Aurélie Bugeau, Patrick Pérez
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
14 years 5 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...
AAIM
2007
Springer
101views Algorithms» more  AAIM 2007»
14 years 5 months ago
How to Play the Majority Game with Liars
Steve Butler, Jia Mao, Ronald L. Graham
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
14 years 5 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
AAIM
2007
Springer
103views Algorithms» more  AAIM 2007»
14 years 5 months ago
Strip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithm...
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
AAIM
2007
Springer
141views Algorithms» more  AAIM 2007»
14 years 5 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 5 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
14 years 5 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
AAIM
2007
Springer
115views Algorithms» more  AAIM 2007»
14 years 5 months ago
Optimal Order Allocation with Discount Pricing
Boris Goldengorin, John Keane, Viktor Kuzmenko, Mi...
AAIM
2007
Springer
94views Algorithms» more  AAIM 2007»
14 years 5 months ago
An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options
Abstract. Pricing arithmetic average options continues to intrigue researchers in the field of financial engineering. Since there is no analytical solution for this problem until...
Tian-Shyr Dai, Jr-Yan Wang, Hui-Shan Wei