1629 search results - page 105 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
DEXAW
1999
IEEE
15 years 2 months ago
1999
IEEE
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
PRL
2010
14 years 8 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
142
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
SSDBM
2010
IEEE
14 years 7 months ago
2010
IEEE
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...