Sciweavers

11231 search results - page 1870 / 2247
» Digging for Data Structures
Sort
View
DCC
2006
IEEE
16 years 4 months ago
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
Amir Ingber, Meir Feder
ESOP
2010
Springer
16 years 1 months ago
Precise and Automated Contract-based Reasoning for Verification and Certification of Information Flow Properties of Programs wit
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
Torben Amtoft, John Hatcliff and Edwin Rodríguez
VMCAI
2010
Springer
16 years 1 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
PAKDD
2009
ACM
120views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Detecting Link Hijacking by Web Spammers.
Abstract. Since current search engines employ link-based ranking algorithms as an important tool to decide a ranking of sites, Web spammers are making a significant effort to man...
Masaru Kitsuregawa, Masashi Toyoda, Young-joo Chun...
SDM
2009
SIAM
223views Data Mining» more  SDM 2009»
16 years 1 months ago
Context Aware Trace Clustering: Towards Improving Process Mining Results.
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
« Prev « First page 1870 / 2247 Last » Next »