1461 search results - page 169 / 293 » Complexity of Graph Covering Problems |
DATE
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
SPATIALCOGNITION
2000
Springer
14 years 1 months ago
2000
Springer
Navigation has always been an interdisciplinary topic of research, because mobile agents of different types are inevitably faced with similar navigational problems. Therefore, huma...
JDCTA
2010
13 years 4 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
ECCC
2006
13 years 10 months ago
2006
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
FASE
2007
Springer
14 years 4 months ago
2007
Springer
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...