1629 search results - page 205 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
With the projected significant growth in mobile internet and multimedia services, there is a strong demand for nextgeneration appliances capable of wireless image communication. O...
MM
2005
ACM
15 years 3 months ago
2005
ACM
Learning the user’s semantics for CBIR involves two different sources of information: the similarity relations entailed by the content-based features, and the relevance relatio...
113
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
SIGCOMM
2009
ACM
15 years 4 months ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...