Sciweavers

4378 search results - page 865 / 876
» On the Complexity of Ordered Colourings
Sort
View
ICDM
2010
IEEE
273views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning Maximum Lag for Grouped Graphical Granger Models
Temporal causal modeling has been a highly active research area in the last few decades. Temporal or time series data arises in a wide array of application domains ranging from med...
Amit Dhurandhar
IMC
2010
ACM
13 years 5 months ago
What happened in my network: mining network events from router syslogs
Router syslogs are messages that a router logs to describe a wide range of events observed by it. They are considered one of the most valuable data sources for monitoring network ...
Tongqing Qiu, Zihui Ge, Dan Pei, Jia Wang, Jun Xu
SIGSOFT
2010
ACM
13 years 5 months ago
Language-based replay via data flow cut
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
Ming Wu, Fan Long, Xi Wang, Zhilei Xu, Haoxiang Li...
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 5 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 5 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...