Sciweavers

251 search results - page 14 / 51
» Polynomial Time Algorithms for Three-Label Point Labeling
Sort
View
FOIKS
2008
Springer
14 years 4 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 27 days ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc
ACSD
2007
IEEE
88views Hardware» more  ACSD 2007»
14 years 1 months ago
Testing the executability of scenarios in general inhibitor nets
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
Robert Lorenz, Sebastian Mauser, Robin Bergenthum
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 1 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee