Sciweavers

280 search results - page 9 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
84
Voted
ICCCN
2008
IEEE
15 years 6 months ago
Clique-Based Location Estimations for Wireless Sensors in GPS-Free Environments
– 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...
Patryk Mazurkiewicz, Kin K. Leung
CASES
2007
ACM
15 years 3 months ago
Rethinking custom ISE identification: a new processor-agnostic method
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...
Ajay K. Verma, Philip Brisk, Paolo Ienne
84
Voted
RECOMB
2007
Springer
15 years 12 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
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...
Joshua A. Grochow, Manolis Kellis
SIAMJO
2002
142views more  SIAMJO 2002»
14 years 11 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
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 ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
COR
2006
95views more  COR 2006»
14 years 11 months ago
Generating optimal two-section cutting patterns for rectangular blanks
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...
Yaodong Cui, Dongli He, Xiaoxia Song