Sciweavers

4833 search results - page 926 / 967
» Computation in a distributed information market
Sort
View
PLDI
1990
ACM
15 years 1 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
PERCOM
2010
ACM
15 years 1 months ago
Adaptive deployment for pervasive data gathering in connectivity-challenged environments
—Some current and future pervasive data driven applications must operate in ”extreme” environments where endto-end connectivity cannot be guaranteed at all times. In fact, it...
Tahiry Razafindralambo, Nathalie Mitton, Aline Car...
FOCS
2004
IEEE
15 years 1 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
15 years 1 months ago
Incremental quantile estimation for massive tracking
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
Fei Chen, Diane Lambert, José C. Pinheiro
COMPGEOM
1987
ACM
15 years 1 months ago
Polygon Properties Calculated from the Vertex Neighborhoods
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
Wm. Randolph Franklin