Sciweavers

753 search results - page 13 / 151
» Completing a (k - 1)-Assignment
Sort
View
EJC
2008
14 years 9 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
EOR
2007
73views more  EOR 2007»
14 years 9 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...
MAGS
2006
79views more  MAGS 2006»
14 years 9 months ago
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
Rohit Gupta, Souvik Ray, Arun K. Somani, Zhao Zhan...
NAR
2011
191views Computer Vision» more  NAR 2011»
14 years 18 days ago
ConsensusPathDB: toward a more complete picture of cell biology
ConsensusPathDB is a meta-database that integrates different types of functional interactions from heterogeneous interaction data resources. Physical protein interactions, metabol...
Atanas Kamburov, Konstantin Pentchev, Hanna Galick...
FORTE
2003
14 years 11 months ago
Correct Passive Testing Algorithms and Complete Fault Coverage
The aim of passive testing is to detect faults in a system while observing the system during normal operation, that is, without forcing the system to specialized inputs explicitly ...
Arun N. Netravali, Krishan K. Sabnani, Ramesh Visw...