1461 search results - page 116 / 293 » Complexity of Graph Covering Problems |
103
click to vote
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
102
click to vote
TCS
2008
14 years 10 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
CGI
2004
IEEE
15 years 1 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...