1149 search results - page 112 / 230 » Minimally non-Pfaffian graphs |
184
click to vote
DAM
2008
15 years 6 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
149
click to vote
IJCAI
2007
15 years 7 months ago
2007
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
175
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
221
click to vote
PVLDB
2010
15 years 1 months ago
2010
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
191
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...