Sciweavers

6142 search results - page 690 / 1229
» The Complexity of Partition Functions
Sort
View
JCT
2010
83views more  JCT 2010»
15 years 5 months ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
BMCBI
2011
15 years 2 months ago
nocoRNAc: Characterization of non-coding RNAs in prokaryotes
Background: The interest in non-coding RNAs (ncRNAs) constantly rose during the past few years because of the wide spectrum of biological processes in which they are involved. Thi...
Alexander Herbig, Kay Nieselt
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
14 years 6 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
13 years 9 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin