Sciweavers

3708 search results - page 52 / 742
» Approximating Betweenness Centrality
Sort
View
ICASSP
2008
IEEE
14 years 5 months ago
Signal approximation using the bilinear transform
This paper explores the approximation properties of a unique basis expansion, which realizes a bilinear frequency warping between a continuous-time signal and its discrete-time re...
Archana Venkataraman, Alan V. Oppenheim
AMC
2008
99views more  AMC 2008»
13 years 11 months ago
Markov chain network training and conservation law approximations: Linking microscopic and macroscopic models for evolution
In this paper, a general framework for the analysis of a connection between the training of artificial neural networks via the dynamics of Markov chains and the approximation of c...
Roderick V. N. Melnik
LICS
2003
IEEE
14 years 4 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
WWW
2007
ACM
14 years 11 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
CSL
2006
Springer
14 years 2 months ago
Weak Bisimulation Approximants
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
Will Harwood, Faron Moller, Anton Setzer