Sciweavers

1552 search results - page 192 / 311
» On the Complexity of Constant Propagation
Sort
View
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
COLT
2000
Springer
15 years 10 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 8 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
AVI
2010
15 years 8 months ago
Showtime: increasing viewer understanding of dynamic network visualisations
Visualisations of dynamic networks are animated over time, reflecting changes in the underlying data structure. As viewers of these visualisations, it is up to us to accurately pe...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
BIS
2007
144views Business» more  BIS 2007»
15 years 8 months ago
Automated Integration Tests for Mobile Applications in Java 2 Micro Edition
Applications written for mobile devices have become more and more complex, adjusting to the constantly improving computational power of hardware. With the growing application size ...
Dawid Weiss, Marcin Zduniak