Sciweavers

3096 search results - page 71 / 620
» The Generalized FITC Approximation
Sort
View
COMBINATORICA
2010
13 years 3 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
ICALP
2009
Springer
14 years 9 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
ICTAI
2002
IEEE
14 years 1 months ago
Function Approximation Using Robust Wavelet Neural Networks
Wavelet neural networks (WNN) have recently attracted great interest, because of their advantages over radial basis function networks (RBFN) as they are universal approximators bu...
Sheng-Tun Li, Shu-Ching Chen
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 3 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
CIDR
2003
134views Algorithms» more  CIDR 2003»
13 years 10 months ago
Approximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi