Sciweavers

834 search results - page 48 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
IPTPS
2005
Springer
15 years 5 months ago
Peering Peer-to-Peer Providers
The early peer-to-peer applications eschewed commercial arrangements and instead established a grass-roots model in which the collection of end-users provided their own distribute...
Hari Balakrishnan, Scott Shenker, Michael Walfish
ICIP
2005
IEEE
16 years 1 months ago
Multiple active contour models based on the EM algorithm
This paper describes an algorithm for the extraction of multiple regions using multiple active contour models (ACMs). The algorithm organizes edge points into strokes and assigns ...
Margarida Silveira, Jorge S. Marques
CONCUR
2007
Springer
15 years 6 months ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
SENSYS
2006
ACM
15 years 5 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
CORR
2010
Springer
68views Education» more  CORR 2010»
14 years 12 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans