Sciweavers

5580 search results - page 923 / 1116
» Randomized priority algorithms
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
14 years 9 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
INFOCOM
2009
IEEE
14 years 4 months ago
Network Coding Meets TCP
—We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the sourc...
Jay Kumar Sundararajan, Devavrat Shah, Muriel M&ea...
ACML
2009
Springer
14 years 4 months ago
Context-Aware Online Commercial Intention Detection
With more and more commercial activities moving onto the Internet, people tend to purchase what they need through Internet or conduct some online research before the actual transac...
Derek Hao Hu, Dou Shen, Jian-Tao Sun, Qiang Yang, ...
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
14 years 4 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...