Sciweavers

4255 search results - page 131 / 851
» Cover
Sort
View
ECCC
2006
80views more  ECCC 2006»
15 years 4 months ago
Packing to angles and sectors
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasivis...
IJSNET
2006
110views more  IJSNET 2006»
15 years 4 months ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu
134
Voted
CPC
2000
58views more  CPC 2000»
15 years 4 months ago
Packing Ferrers Shapes
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
Noga Alon, Miklós Bóna, Joel Spencer
DM
2000
91views more  DM 2000»
15 years 4 months ago
Perfection thickness of graphs
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
Hirotsugu Asari, Tao Jiang, André Künd...
CORR
1999
Springer
97views Education» more  CORR 1999»
15 years 3 months ago
A Formal Framework for Linguistic Annotation
`Linguistic annotation' covers any descriptive or analytic notations applied to raw language data. The basic data may be in the form of time functions
Steven Bird, Mark Liberman