239 search results - page 42 / 48 » Hardness and algorithms for rainbow connection |
102
click to vote
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
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...
160
Voted
GIS
2005
ACM
15 years 10 months ago
2005
ACM
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
MOBISYS
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we present a reliable storage service, called SolarStore, that adaptively trades-off storage reliability versus energy consumption in solar-powered sensor networks....
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
RECOMB
2004
Springer
15 years 9 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...