Sciweavers

152 search results - page 28 / 31
» Equations over Sets of Natural Numbers with Addition Only
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 3 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 18 days ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
15 years 5 months ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
BMCBI
2010
97views more  BMCBI 2010»
14 years 11 months ago
SeqRate: sequence-based protein folding type classification and rates prediction
Background: Protein folding rate is an important property of a protein. Predicting protein folding rate is useful for understanding protein folding process and guiding protein des...
Guan Ning Lin, Zheng Wang, Dong Xu, Jianlin Cheng
CHI
2010
ACM
15 years 5 months ago
Real time search user behavior
Real time search is an increasingly important area of information seeking on the Web. In this research, we analyze 1,005,296 user interactions with a real time search engine over ...
Bernard J. Jansen, Gerry Campbell, Matthew Gregg