280 search results - page 9 / 56 » New Algorithms for Enumerating All Maximal Cliques |
72
Voted
ICCCN
2008
IEEE
15 years 3 months ago
2008
IEEE
– In this paper we present a distributed, self-organizing, localization method for wireless sensors and a scheme for reducing position estimate errors by employing a novel concep...
CASES
2007
ACM
15 years 1 months ago
2007
ACM
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
RECOMB
2007
Springer
15 years 9 months ago
2007
Springer
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
106
click to vote
SIAMJO
2002
14 years 9 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
COR
2006
14 years 9 months ago
2006
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists o...