Sciweavers

500 search results - page 42 / 100
» Quantified Conditionals and Compositionality
Sort
View
SEFM
2006
IEEE
14 years 1 months ago
A PVS Based Framework for Validating Compiler Optimizations
An optimization can be specified as sequential compositions of predefined transformation primitives. For each primitive, we can define soundness conditions which guarantee that th...
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
COLT
2001
Springer
13 years 12 months ago
Geometric Bounds for Generalization in Boosting
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
Shie Mannor, Ron Meir
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
AUTOMATICA
2008
59views more  AUTOMATICA 2008»
13 years 7 months ago
Supervisory control of modular systems with global specification languages
The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synth...
Jan Komenda, Jan H. van Schuppen, Benoit Gaudin, H...
BMCBI
2010
102views more  BMCBI 2010»
13 years 7 months ago
Alignment and clustering of phylogenetic markers - implications for microbial diversity studies
Background: Molecular studies of microbial diversity have provided many insights into the bacterial communities inhabiting the human body and the environment. A common first step ...
James Robert White, Saket Navlakha, Niranjan Nagar...