284 search results - page 29 / 57 » On Some Polyhedra Covering Problems |
ICCCN
2008
IEEE
14 years 3 months ago
2008
IEEE
—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 ...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
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...
SIGUCCS
2003
ACM
14 years 2 months ago
2003
ACM
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...
WADS
1997
Springer
14 years 1 months ago
1997
Springer
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 ...
SC
1993
ACM
14 years 28 days ago
1993
ACM
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...