Sciweavers

973 search results - page 194 / 195
» New Bounds on Crossing Numbers
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 5 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 5 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
TCS
2010
13 years 3 months ago
Incremental learning with temporary memory
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model co...
Sanjay Jain, Steffen Lange, Samuel E. Moelius, San...
WG
2010
Springer
13 years 3 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
TASE
2011
IEEE
12 years 8 months ago
Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
Shengjun Liu, Charlie C. L. Wang