Sciweavers

8501 search results - page 1610 / 1701
» Reactive process networks
Sort
View
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 4 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
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 4 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 4 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
EUROSYS
2008
ACM
16 years 1 months ago
Eudaemon: involuntary and on-demand emulation against zero-day exploits
Eudaemon is a technique that aims to blur the borders between protected and unprotected applications, and brings together honeypot technology and end-user intrusion detection and ...
Georgios Portokalidis, Herbert Bos
ICCD
2007
IEEE
183views Hardware» more  ICCD 2007»
16 years 1 months ago
Constraint satisfaction in incremental placement with application to performance optimization under power constraints
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
Huan Ren, Shantanu Dutt
« Prev « First page 1610 / 1701 Last » Next »