Sciweavers

25156 search results - page 4829 / 5032
» Applications for conscious systems
Sort
View
ICALP
2009
Springer
16 years 6 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
235
Voted
VLDB
2008
ACM
127views Database» more  VLDB 2008»
16 years 6 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 6 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
255
Voted
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 6 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 6 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
« Prev « First page 4829 / 5032 Last » Next »