Sciweavers

3943 search results - page 617 / 789
» Architecture-Level Requirements Specification
Sort
View
POPL
2003
ACM
16 years 5 months ago
Interprocedural compatibility analysis for static object preallocation
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. ...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
16 years 5 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
16 years 5 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
SIGMOD
2009
ACM
197views Database» more  SIGMOD 2009»
16 years 4 months ago
Secure kNN computation on encrypted databases
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...
Wai Kit Wong, David Wai-Lok Cheung, Ben Kao, Nikos...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 4 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay