Sciweavers

3875 search results - page 345 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ACL
2004
15 years 8 months ago
Computing Locally Coherent Discourses
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
Ernst Althaus, Nikiforos Karamanis, Alexander Koll...
ICRA
2009
IEEE
100views Robotics» more  ICRA 2009»
15 years 4 months ago
Multi-robot plan adaptation by constrained minimal distortion feature mapping
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
Bálint Takács, Yiannis Demiris
TCS
2011
15 years 1 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...
ICCV
2011
IEEE
14 years 6 months ago
Who Blocks Who: Simultaneous Clothing Segmentation for Grouping Images
Clothing is one of the most informative cues of human appearance. In this paper, we propose a novel multi-person clothing segmentation algorithm for highly occluded images. The ke...
Wang Nan, Haizhou Ai
ESANN
2007
15 years 8 months ago
Model Selection for Kernel Probit Regression
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
Gavin C. Cawley