Sciweavers

2778 search results - page 186 / 556
» Limit complexities revisited
Sort
View
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
16 years 18 days ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
ATAL
2008
Springer
15 years 8 months ago
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
MSO
2003
15 years 8 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris
ENVSOFT
2007
108views more  ENVSOFT 2007»
15 years 6 months ago
Modeling biocomplexity - actors, landscapes and alternative futures
: Increasingly, models (and modelers) are being asked to address the interactions between human influences, ecological processes, and landscape dynamics that impact many diverse as...
John P. Bolte, David W. Hulse, Stanley V. Gregory,...
ICCV
2007
IEEE
16 years 8 months ago
Non-Parametric Probabilistic Image Segmentation
We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is princip...
Marco Andreetto, Lihi Zelnik-Manor, Pietro Perona