Sciweavers

1163 search results - page 129 / 233
» Embedding into Bipartite Graphs
Sort
View
FSTTCS
2010
Springer
13 years 6 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
ICIP
2010
IEEE
13 years 6 months ago
Learning image similarities via Probabilistic Feature Matching
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...
Ziming Zhang, Ze-Nian Li, Mark S. Drew
SOCIALCOM
2010
13 years 6 months ago
On the Navigability of Social Tagging Systems
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
Denis Helic, Christoph Trattner, Markus Strohmaier...
EACL
2009
ACL Anthology
13 years 6 months ago
Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
Stephen Wan, Mark Dras, Robert Dale, Cécile...
INFOCOM
2011
IEEE
12 years 12 months ago
Network-aware behavior clustering of Internet end hosts
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...
Kuai Xu, Feng Wang 0002, Lin Gu