Sciweavers

956 search results - page 132 / 192
» Dimensions in program synthesis
Sort
View
JASIS
2006
108views more  JASIS 2006»
13 years 10 months ago
Fuzzy techniques for trust and reputation management in anonymous peer-to-peer systems
P2P applications are rapidly gaining acceptance among users of Internet-based services, especially because of their capability of exchanging resources while preserving the anonymi...
Roberto Aringhieri, Ernesto Damiani, Sabrina De Ca...
MVA
2002
146views Computer Vision» more  MVA 2002»
13 years 9 months ago
Motion segmentation and pose recognition with motion history gradients
This paper uses a simple method for representing motion in successively layered silhouettes that directly encode system time termed the timed Motion History Image (tMHI). This rep...
Gary R. Bradski, James W. Davis
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 3 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
TGC
2005
Springer
14 years 3 months ago
Concurrency Among Strangers
Programmers write programs, expressing plans for machines to execute. When composed so that they may cooperate, plans may instead interfere with each other in unanticipated ways. P...
Mark S. Miller, Eric Dean Tribble, Jonathan S. Sha...
ICALP
2011
Springer
13 years 1 months ago
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...