Sciweavers

1291 search results - page 230 / 259
» Optimally switched linear systems
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 5 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
13 years 2 months ago
Multi-robot monitoring in dynamic environments with guaranteed currency of observations
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
Stephen L. Smith, Daniela Rus
COLING
2010
13 years 2 months ago
EMMA: A novel Evaluation Metric for Morphological Analysis
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
Sebastian Spiegler, Christian Monson
EGH
2011
Springer
12 years 7 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
IACR
2011
252views more  IACR 2011»
12 years 7 months ago
A Meet-in-the-Middle Attack on the Full KASUMI
KASUMI is a block cipher which consists eight Feistel rounds with a 128-bit key. The confidentiality and integrity of UMTS, GSM and GPRS mobile communications systems depend heavi...
Keting Jia, Hongbo Yu, Xiaoyun Wang