Sciweavers

1272 search results - page 220 / 255
» The Set Cover with Pairs Problem
Sort
View
DCG
2008
93views more  DCG 2008»
13 years 10 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
EJC
2008
13 years 10 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal
FUIN
2008
98views more  FUIN 2008»
13 years 10 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 10 months ago
Statistical tools to assess the reliability of self-organizing maps
Results of neural network learning are always subject to some variability, due to the sensitivity to initial conditions, to convergence to local minima, and, sometimes more dramat...
Eric de Bodt, Marie Cottrell, Michel Verleysen
ENTCS
2007
93views more  ENTCS 2007»
13 years 10 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...