Sciweavers

3422 search results - page 433 / 685
» Random Subset Optimization
Sort
View
139
Voted
EUROSYS
2011
ACM
14 years 7 months ago
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
Tobias Distler, Rüdiger Kapitza
GIS
2011
ACM
14 years 7 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
ICCV
2011
IEEE
14 years 3 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
ICC
2011
IEEE
203views Communications» more  ICC 2011»
14 years 3 months ago
Constellation Shaping for Bit-Interleaved Coded APSK
—This paper considers a technique for shaping a turbo-coded amplitude-phase shift keying (APSK) constellation. After bit-interleaving, a subset of the bits output by a binary tur...
Matthew C. Valenti, Xingyu Xiang
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
13 years 6 months ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett