Sciweavers

300 search results - page 34 / 60
» Extension of a theorem of Whitney
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
WOSP
2010
ACM
14 years 2 months ago
A general result for deriving product-form solutions in markovian models
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
Andrea Marin, Maria Grazia Vigliotti
FOSSACS
2010
Springer
14 years 2 months ago
A Hierarchy for Delimited Continuations in Call-by-Name
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
Alexis Saurin
LICS
2008
IEEE
14 years 2 months ago
Mechanizing the Metatheory of LF
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
Christian Urban, James Cheney, Stefan Berghofer
ICC
2007
IEEE
138views Communications» more  ICC 2007»
14 years 2 months ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy