Sciweavers

9405 search results - page 190 / 1881
» Computing a Model of Set Theory
Sort
View
149
Voted
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
13 years 5 months ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass
RSCTC
2004
Springer
144views Fuzzy Logic» more  RSCTC 2004»
15 years 8 months ago
Approximation Spaces and Information Granulation
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
Andrzej Skowron, Roman W. Swiniarski, Piotr Synak
102
Voted
ICPR
2002
IEEE
15 years 8 months ago
Motion Prediction Using VC-Generalization Bounds
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Ch...
TSP
2008
123views more  TSP 2008»
15 years 3 months ago
A Rough Programming Approach to Power-Balanced Instruction Scheduling for VLIW Digital Signal Processors
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
Shu Xiao, Edmund Ming-Kit Lai
122
Voted
RTA
2010
Springer
15 years 7 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram