920 search results - page 141 / 184 » Computing the Frequency of Partial Orders |
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
In this work a new method to retrieve images with similar lighting conditions is presented. It is based on automatic clustering and automatic indexing. Our proposal belongs to Con...
TKDE
2012
12 years 2 days ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Many sectors of the military are interested in Self-Organized (SO) systems because of their flexibility, versatility and economics. The military is researching and employing auto...
NETWORKS
2011
13 years 15 days ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
IJCNN
2000
IEEE
14 years 1 months ago
2000
IEEE
The field of human-computer interaction has been widely investigated in the last years, resulting in a variety of systems used in different application fields like virtual reality...