760 search results - page 144 / 152 » Algorithms for finding clique-transversals of graphs |
IWCIA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
CEC
2007
IEEE
2007
IEEE
Mining association rules from databases with continuous attributes using genetic network programming
13 years 11 months ago
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
ISPD
2000
ACM
13 years 12 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...