Sciweavers

4372 search results - page 594 / 875
» Algorithmic Theories of Everything
Sort
View
DEDS
2007
104views more  DEDS 2007»
15 years 6 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
JCO
2006
126views more  JCO 2006»
15 years 6 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li
ECCC
2007
123views more  ECCC 2007»
15 years 6 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
JLP
2006
108views more  JLP 2006»
15 years 6 months ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi
JMLR
2006
103views more  JMLR 2006»
15 years 6 months ago
Pattern Recognition for Conditionally Independent Data
In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
Daniil Ryabko