Sciweavers

1477 search results - page 95 / 296
» Random Convex Programs
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Oblivious Routing with Mobile Fusion Centers over a Sensor Network
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
Devavrat Shah, Sanjay Shakkottai
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 4 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
14 years 9 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu
ICALP
2007
Springer
14 years 3 months ago
Ring Signatures of Sub-linear Size Without Random Oracles
Ring signatures, introduced by Rivest, Shamir and Tauman, enable a user to sign a message anonymously on behalf of a “ring”. A ring is a group of users, which includes the sign...
Nishanth Chandran, Jens Groth, Amit Sahai
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
14 years 10 days ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow