Sciweavers

13987 search results - page 2533 / 2798
» The Two Guards Problem
Sort
View
COMPGEOM
2007
ACM
15 years 8 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
Julien Demouth, Olivier Devillers, Hazel Everett, ...
BMCBI
2007
157views more  BMCBI 2007»
15 years 6 months ago
Improving gene set analysis of microarray data by SAM-GS
Background: Gene-set analysis evaluates the expression of biological pathways, or a priori defined gene sets, rather than that of individual genes, in association with a binary ph...
Irina Dinu, John D. Potter, Thomas Mueller, Qi Liu...
IANDC
2008
141views more  IANDC 2008»
15 years 6 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
COMPGEOM
2006
ACM
16 years 21 days ago
Locked and unlocked chains of planar shapes
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
15 years 12 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
« Prev « First page 2533 / 2798 Last » Next »