204 search results - page 25 / 41 » Testing Triangle-Freeness in General Graphs |
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
MM
2006
ACM
14 years 1 months ago
2006
ACM
This paper presents a novel approach to object recognition involving a sparse 2D model and matching using video. The model is generated on the basis of geometry and image measurab...
ISCIS
2005
Springer
14 years 1 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
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...
AIRWEB
2009
Springer
14 years 2 months ago
2009
Springer
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...