Sciweavers

1690 search results - page 256 / 338
» Algorithmic Properties of Millstream Systems
Sort
View
119
Voted
ICALP
2009
Springer
16 years 1 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
187
Voted
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 1 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
120
Voted
SPAA
2009
ACM
15 years 10 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
CIKM
2009
Springer
15 years 7 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
140
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
A Compound TCP Approach for High-Speed and Long Distance Networks
—Many applications require fast data transfer over high speed and long distance networks. However, standard TCP fails to fully utilize the network capacity due to the limitation ...
Kun Tan, Jingmin Song, Qian Zhang, Murari Sridhara...