Sciweavers

1963 search results - page 244 / 393
» The Maximum Solution Problem on Graphs
Sort
View
121
Voted
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 3 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
ESWS
2010
Springer
15 years 8 months ago
OWL Reasoning with WebPIE: Calculating the Closure of 100 Billion Triples
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Fra...
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
16 years 11 days ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
CIKM
2010
Springer
14 years 10 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
INFOCOM
2007
IEEE
15 years 9 months ago
Lexicographic Fairness in WDM Optical Cross-Connects
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...
Satya Ranjan Mohanty, Laxmi N. Bhuyan