1461 search results - page 169 / 293 » Complexity of Graph Covering Problems |
102
Voted
DATE
2010
IEEE
15 years 7 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...
126
click to vote
SPATIALCOGNITION
2000
Springer
15 years 6 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...
115
click to vote
JDCTA
2010
14 years 9 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 ...
119
click to vote
ECCC
2006
15 years 2 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...
129
click to vote
FASE
2007
Springer
15 years 8 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...