Sciweavers

347 search results - page 46 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
ACISP
2009
Springer
15 years 6 months ago
Inside the Hypercube
Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...
Jean-Philippe Aumasson, Eric Brier, Willi Meier, M...
SOFSEM
2007
Springer
15 years 5 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
CG
2007
Springer
14 years 11 months ago
Visual data mining and analysis of software repositories
In this article we describe an ongoing effort to integrate information visualization techniques into the process of configuration management for software systems. Our focus is to...
Lucian Voinea, Alexandru Telea
85
Voted
ICALP
2009
Springer
16 years 1 days ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty