4378 search results - page 162 / 876 » On the Complexity of Ordered Colourings |
147
click to vote
ESWS
2007
Springer
16 years 20 days ago
2007
Springer
Large and complex enterprise systems face the same kind of information processing problems that exist on the web in general, and constructing an ontology is a crucial part of many ...
160
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
177
click to vote
ICCBR
2010
Springer
2010
Springer
Experience-Based Critiquing: Reusing Critiquing Experiences to Improve Conversational Recommendation
15 years 5 months ago
Product recommendation systems are now a key part of many e-commerce services and have proven to be a successful way to help users navigate complex product spaces. In this paper, w...
195
click to vote
ESSLLI
2009
Springer
15 years 4 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
159
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...