Sciweavers

2254 search results - page 301 / 451
» Computing the minimal covering set
Sort
View
ALT
2006
Springer
16 years 3 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
FOSSACS
2009
Springer
16 years 1 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
ICPP
2009
IEEE
16 years 26 days ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...
IWPEC
2009
Springer
16 years 23 days ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
IEEESCC
2007
IEEE
16 years 15 days ago
Exchanging Policies between Web Service Entities using Rule Languages
Web rule languages with the ability to cover various types of rules have been recently emerged to make interactions between web resources and broker agents possible. The chance of...
Nima Kaviani, Dragan Gasevic, Marek Hatala, Gerd W...