Sciweavers

206 search results - page 40 / 42
» Type Inference for Variant Object Types
Sort
View
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 6 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
CGF
2011
12 years 10 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
LICS
2008
IEEE
14 years 1 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
INFOVIS
2005
IEEE
14 years 8 days ago
Importance-Driven Visualization Layouts for Large Time Series Data
Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in p...
Ming C. Hao, Umeshwar Dayal, Daniel A. Keim, Tobia...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 2 days ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella