Sciweavers

518 search results - page 101 / 104
» Beating a Random Assignment
Sort
View
MST
2000
57views more  MST 2000»
14 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
74
Voted
TMC
2002
118views more  TMC 2002»
14 years 9 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
PVLDB
2008
163views more  PVLDB 2008»
14 years 9 months ago
C-DEM: a multi-modal query system for Drosophila Embryo databases
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as informatio...
Fan Guo, Lei Li, Christos Faloutsos, Eric P. Xing
INFOCOM
2010
IEEE
14 years 8 months ago
A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping
Abstract—With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are hig...
Fengjun Li, Bo Luo, Peng Liu, Chao-Hsien Chu
INTERNET
2010
119views more  INTERNET 2010»
14 years 8 months ago
A Chat Application in Lift
s the HTTP request–response cycle rather than wrapping HTTP concepts in APIs. This means you put HTML element definition and action in the same place: var name = "" SHt...
David Pollak, Steve Vinoski