Sciweavers

183 search results - page 8 / 37
» Practical Random Number Generation in Software
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 10 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
EMSOFT
2008
Springer
13 years 11 months ago
Volatiles are miscompiled, and what to do about it
C's volatile qualifier is intended to provide a reliable link between operations at the source-code level and operations at the memorysystem level. We tested thirteen product...
Eric Eide, John Regehr
QSIC
2005
IEEE
14 years 3 months ago
Towards Making Agent UML Practical: A Textual Notation and a Tool
Design notations play an important role in designing software. Agent UML (AUML), which extends the widelyused UML notation, has proposed a number of notations for modelling agent ...
Michael Winikoff
CVPR
2010
IEEE
13 years 12 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ADHOCNOW
2004
Springer
14 years 3 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi