1411 search results - page 197 / 283 » A Value Analysis for C Programs |
127
click to vote
IRI
2006
IEEE
15 years 11 months ago
2006
IEEE
With the rapidly increasing complexity of computer systems and the sophistication of hacking tools and techniques, there is a crucial need for computer forensic analysis technique...
167
click to vote
VALUETOOLS
2006
ACM
15 years 11 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
154
Voted
COLT
2005
Springer
15 years 10 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
174
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
131
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce ...