Sciweavers

5981 search results - page 454 / 1197
» time 2006
Sort
View
COCOON
2006
Springer
15 years 10 months ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang
COMPLIFE
2006
Springer
15 years 10 months ago
Set-Oriented Dimension Reduction: Localizing Principal Component Analysis Via Hidden Markov Models
We present a method for simultaneous dimension reduction and metastability analysis of high dimensional time series. The approach is based on the combination of hidden Markov model...
Illia Horenko, Johannes Schmidt-Ehrenberg, Christo...
DALT
2006
Springer
15 years 10 months ago
When Agents Communicate Hypotheses in Critical Situations
This paper discusses the problem of efficient propagation of uncertain information in dynamic environments and critical situations. When a number of (distributed) agents have only ...
Gauvain Bourgne, Nicolas Maudet, Suzanne Pinson
DATE
2006
IEEE
120views Hardware» more  DATE 2006»
15 years 10 months ago
Battery-aware code partitioning for a text to speech system
The advent of multi-core embedded processors has brought along new challenges for embedded system design. This paper presents an efficient, battery aware, code partitioning techni...
Anirban Lahiri, Anupam Basu, Monojit Choudhury, Sr...
DIAGRAMS
2006
Springer
15 years 10 months ago
Exploring the Notion of 'Clutter' in Euler Diagrams
Abstract. Euler diagrams are an effective and intuitive way of representing relationships between sets. As the number of sets represented grows, Euler diagrams can become `cluttere...
Chris John, Andrew Fish, John Howse, John Taylor