Sciweavers

1255 search results - page 161 / 251
» On Simple and Secure Key Distribution
Sort
View

Publication
189views
15 years 8 months ago
Direct Send Compositing for Parallel Sort-Last Rendering
In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can eas...
Stefan Eilemann, Renato Pajarola
JACM
2006
146views more  JACM 2006»
15 years 4 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
ML
2006
ACM
110views Machine Learning» more  ML 2006»
15 years 4 months ago
Distribution-based aggregation for relational learning with identifier attributes
Abstract Identifier attributes--very high-dimensional categorical attributes such as particular product ids or people's names--rarely are incorporated in statistical modeling....
Claudia Perlich, Foster J. Provost
121
Voted
QUESTA
2008
73views more  QUESTA 2008»
15 years 3 months ago
Optimal control of parallel server systems with many servers in heavy traffic
We consider a parallel server system that consists of several customer classes and server pools in parallel. We propose a simple robust control policy to minimize the total linear...
J. G. Dai, Tolga Tezcan
COMCOM
2006
194views more  COMCOM 2006»
15 years 4 months ago
INSENS: Intrusion-tolerant routing for wireless sensor networks
This paper describes an INtrusion-tolerant routing protocol for wireless SEnsor NetworkS (INSENS). INSENS securely and efficiently constructs tree-structured routing for wireless ...
Jing Deng, Richard Han, Shivakant Mishra