We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Background: Pre-processing methods for two-sample long oligonucleotide arrays, specifically the Agilent technology, have not been extensively studied. The goal of this study is to...
Marianna Zahurak, Giovanni Parmigiani, Wayne Yu, R...
Java applets have been used increasingly on web sites to perform client-side processing and provide dynamic content. While many web site analysis tools are available, their focus ...
Jeffrey L. Korn, Yih-Farn Chen, Eleftherios Koutso...
To prevent or alleviate conflicts in multi-agent environments, it is important to distinguish between situations where another agent has misbehaved intentionally and situations wh...
This paper introduces a hierarchical Markov model that can learn and infer a user's daily movements through the commue model uses multiple levels of abstraction in order to b...