Sciweavers

315 search results - page 7 / 63
» Better Approximation of Betweenness Centrality
Sort
View
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 3 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ý
ECSCW
2001
15 years 1 months ago
Flexible support for application-sharing architecture
Current application-sharing systems support a single architecture for all collaborations, though different systems support different architectures We have developed a system that s...
Goopeel Chung, Prasun Dewan
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 1 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 6 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
CONIELECOMP
2006
IEEE
15 years 5 months ago
Chaotic Time Series Approximation Using Iterative Wavelet-Networks
This paper presents a wavelet neural-network for learning and approximation of chaotic time series. Wavelet-networks are inspired by both feed-forward neural networks and the theo...
E. S. Garcia-Trevino, Vicente Alarcón Aquin...