Sciweavers

4103 search results - page 198 / 821
» Some results on the Collatz problem
Sort
View
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
15 years 8 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
IADIS
2004
15 years 8 months ago
ATEAM - agent mediated team performance model
This paper introduces a study about managing the performance of virtual teams using intelligent agents. Through a review of previous research, the paper starts by contextually sit...
Mauro Nunes, Henrique O'Neill
MVA
2000
159views Computer Vision» more  MVA 2000»
15 years 8 months ago
Yet Another Appearance-Based Method for Pose Estimation Based on a linear Model
This paper explores the possibility of a linear model as a solution to the problem of appearance-based pose estimation. The parametric eigenspace method (or its extensions that ar...
Takayuki Okatani, Koichiro Deguchi
ATVA
2010
Springer
114views Hardware» more  ATVA 2010»
15 years 6 months ago
Methods for Knowledge Based Controlling of Distributed Systems
Abstract. Controlling concurrent systems to impose some global invariant is an undecidable problem. One can gain decidability at the expense of reducing concurrency. Even under thi...
Saddek Bensalem, Marius Bozga, Susanne Graf, Doron...
LATIN
2004
Springer
16 years 1 days ago
On the (Im)possibility of Non-interactive Correlation Distillation
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
Ke Yang