Sciweavers

250 search results - page 39 / 50
» Linear Text Segmentation using a Dynamic Programming Algorit...
Sort
View
ICPADS
2005
IEEE
14 years 1 months ago
Minimizing Energy via Loop Scheduling and DVS for Multi-Core Embedded Systems
Low energy consumptions are extremely important in real-time embedded systems, and scheduling is one of the techniques used to obtain lower energy consumptions. In this paper, we ...
Ying Chen, Zili Shao, Qingfeng Zhuge, Chun Xue, Bi...
CAGD
2008
99views more  CAGD 2008»
13 years 8 months ago
Topology and arrangement computation of semi-algebraic planar curves
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
Lionel Alberti, Bernard Mourrain, Julien Wintz
SIAMIS
2010
378views more  SIAMIS 2010»
13 years 2 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
STACS
2010
Springer
14 years 2 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith