Sciweavers

2621 search results - page 357 / 525
» Near orders and codes
Sort
View
WWW
2010
ACM
16 years 1 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
16 years 1 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
ESOP
2009
Springer
16 years 1 months ago
Well-Typed Programs Can't Be Blamed
We show how contracts with blame fit naturally with recent work on hybrid types and gradual types. Unlike hybrid types or gradual types, we require casts in the source code, in o...
Philip Wadler, Robert Bruce Findler
HYBRID
2009
Springer
16 years 1 months ago
Parameter Synthesis for Hybrid Systems with an Application to Simulink Models
Abstract. This paper addresses a parameter synthesis problem for nonlinear hybrid systems. Considering a set of uncertain parameters and a safety property, we give an algorithm tha...
Alexandre Donzé, Bruce H. Krogh, Akshay Raj...
IPPS
2009
IEEE
16 years 1 months ago
Guiding performance tuning for grid schedules
Grid jobs often consist of a large number of tasks. If the performance of a statically scheduled grid job is unsatisfactory, one must decide which code of which task should be imp...
Jörg Keller, Wolfram Schiffmann