Sciweavers

121 search results - page 17 / 25
» Random Assignment with Integer Costs
Sort
View
ACCV
2010
Springer
13 years 2 months ago
A Unified Approach to Segmentation and Categorization of Dynamic Textures
Dynamic textures (DT) are videos of non-rigid dynamical objects, such as fire and waves, which constantly change their shape and appearance over time. Most of the prior work on DT ...
Avinash Ravichandran, Paolo Favaro, René Vi...
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
CVPR
2009
IEEE
15 years 1 months ago
Tracking of Cell Populations to Understand their Spatio-Temporal Behavior in Response to Physical Stimuli
We have developed methods for segmentation and tracking of cells in time-lapse phase-contrast microscopy images. Our multi-object Bayesian algorithm detects and tracks large num...
David House, Matthew Walker, Zheng Wu, Joyce Wong,...
ICML
2007
IEEE
14 years 8 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
EWSN
2009
Springer
14 years 8 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...