—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
Working on a small campus has many advantages: Familiarity with the majority of faculty and staff, in-depth knowledge of how systems interact, adding the personal touch to each in...
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
Within the past few years, computer graphics has played a decisive role in transforming the field of molecular modeling into an intemaiional industry. While computer scientists ar...