Sciweavers

4488 search results - page 130 / 898
» Properties of NP-Complete Sets
Sort
View
FUIN
2007
116views more  FUIN 2007»
13 years 8 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
IPSN
2005
Springer
14 years 1 months ago
Statistical model of lossy links in wireless sensor networks
Abstract— Recently, several wireless sensor network studies demonstrated large discrepancies between experimentally observed communication properties and properties produced by w...
Alberto Cerpa, Jennifer L. Wong, Louane Kuang, Mio...
LREC
2008
125views Education» more  LREC 2008»
13 years 9 months ago
Adaptation of Relation Extraction Rules to New Domains
This paper presents various strategies for improving the extraction performance of less prominent relations with the help of the rules learned for similar relations, for which lar...
Feiyu Xu, Hans Uszkoreit, Hong Li, Niko Felger
JGO
2008
53views more  JGO 2008»
13 years 8 months ago
Smoothing by mollifiers. Part II: nonlinear optimization
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
Hubertus Th. Jongen, Oliver Stein
WOLLIC
2009
Springer
14 years 2 months ago
Recognizability in the Simply Typed Lambda-Calculus
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Sylvain Salvati