Sciweavers

258 search results - page 14 / 52
» Weak Bisimulation Approximants
Sort
View
CAV
2001
Springer
83views Hardware» more  CAV 2001»
15 years 4 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 4 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
ICPR
2006
IEEE
16 years 27 days ago
Weakly Supervised Learning on Pre-image Problem in Kernel Methods
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
Weishi Zheng, Jian-Huang Lai, Pong Chi Yuen
AAAI
1998
15 years 1 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
MOC
2010
14 years 6 months ago
Convergence analysis of the Jacobi spectral-collocation methods for Volterra integral equations with a weakly singular kernel
In this paper, a Jacobi-collocation spectral method is developed for Volterra integral equations of the second kind with a weakly singular kernel. We use some function transformati...
Yanping Chen, Tao Tang