4378 search results - page 231 / 876 » On the Complexity of Ordered Colourings |
290
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. We propos...
170
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Error correcting codes are widely used in communication and storage applications. Codec complexity has usually been measured with a software implementation in mind. A recent hardw...
184
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
155
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
161
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...