Sciweavers

3383 search results - page 676 / 677
» Distributing the power of OLAP
Sort
View
AAAI
2012
11 years 8 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
SIGCSE
2009
ACM
167views Education» more  SIGCSE 2009»
14 years 6 months ago
Python CS1 as preparation for C++ CS2
How suitable is a Python-based CS1 course as preparation for a C++-based CS2 course? After fifteen years of using C++ for both CS1 and CS2, the Computer Science Department at Mich...
Richard J. Enbody, William F. Punch, Mark McCullen
PODC
2009
ACM
14 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
CODES
2005
IEEE
13 years 11 months ago
Spatial division multiplexing: a novel approach for guaranteed throughput on NoCs
To ensure low power consumption while maintaining flexibility and performance, future Systems-on-Chip (SoC) will combine several types of processor cores and data memory units of...
Anthony Leroy, Paul Marchal, Adelina Shickova, Fra...
SASN
2004
ACM
13 years 11 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson