Sciweavers

941 search results - page 73 / 189
» Efficient Testing of Large Graphs
Sort
View
ICCV
1998
IEEE
15 years 11 months ago
View-Based Object Matching
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
Ali Shokoufandeh, Ivan Marsic, Sven J. Dickinson
SC
2005
ACM
15 years 3 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
FCCM
2004
IEEE
133views VLSI» more  FCCM 2004»
15 years 1 months ago
A Methodology for Synthesis of Efficient Intrusion Detection Systems on FPGAs
Intrusion detection for network security is a computation intensive application demanding high system performance. System level design, a relatively unexplored field in this area,...
Zachary K. Baker, Viktor K. Prasanna
ACSC
2010
IEEE
14 years 4 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
15 years 10 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang