Sciweavers

2286 search results - page 297 / 458
» Algorithms for Categorical Equivalence
Sort
View
IWOCA
2009
Springer
153views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Feedback Vertex Set on Graphs of Low Cliquewidth
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
16 years 1 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
PIMRC
2008
IEEE
16 years 1 months ago
A joint routing-MAC model for cellular-relaying networks
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
Bogdan Timus, Pablo Soldati
ICC
2007
IEEE
104views Communications» more  ICC 2007»
16 years 28 days ago
A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risks
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
Qingya She, Xiaodong Huang, Jason P. Jue
RTA
2005
Springer
16 years 2 days ago
Proof-Producing Congruence Closure
Many applications of congruence closure nowadays require the ability of recovering, among the thousands of input equations, the small subset that caused the equivalence of a given ...
Robert Nieuwenhuis, Albert Oliveras