Sciweavers

447 search results - page 32 / 90
» Re-ranking search results using document-passage graphs
Sort
View
CIKM
2007
Springer
14 years 1 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
14 years 2 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
FCCM
2009
IEEE
134views VLSI» more  FCCM 2009»
13 years 11 months ago
Efficient Mapping of Hardware Tasks on Reconfigurable Computers Using Libraries of Architecture Variants
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
Miaoqing Huang, Vikram K. Narayana, Tarek A. El-Gh...
FPL
2008
Springer
113views Hardware» more  FPL 2008»
13 years 9 months ago
Mapping and scheduling with task clustering for heterogeneous computing systems
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
Yuet Ming Lam, José Gabriel F. Coutinho, Wa...
ENDM
2008
93views more  ENDM 2008»
13 years 7 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...