Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
The call stack of a program execution can be a very good information source for intrusion detection. There is no prior work on dynamically extracting information from call stack a...
Henry Hanping Feng, Oleg M. Kolesnikov, Prahlad Fo...
We have written a prototype computer program called TrenDx for automated trend detection during process monitoring. The program uses a representation called trend templates that d...