1225 search results - page 71 / 245 » The Instance Complexity Conjecture |
ESA
2007
Springer
14 years 3 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
EVOW
2010
Springer
14 years 10 days ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
CSL
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
EACL
2006
ACL Anthology
13 years 10 months ago
2006
ACL Anthology
Metonymy recognition is generally approached with complex algorithms that rely heavily on the manual annotation of training and test data. This paper will relieve this complexity ...
IEEEVAST
2010
13 years 3 months ago
2010
Finding patterns in temporal data is an important data analysis task in many domains. Static visualizations can help users easily see certain instances of patterns, but are not sp...