Sciweavers

4131 search results - page 681 / 827
» Compactness in Topology and Computation
Sort
View
WWW
2009
ACM
16 years 7 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
WWW
2009
ACM
16 years 7 months ago
Link based small sample learning for web spam detection
Robust statistical learning based web spam detection system often requires large amounts of labeled training data. However, labeled samples are more difficult, expensive and time ...
Guanggang Geng, Qiudan Li, Xinchang Zhang
WWW
2006
ACM
16 years 7 months ago
Probabilistic models for discovering e-communities
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...
VLSID
2006
IEEE
148views VLSI» more  VLSID 2006»
16 years 6 months ago
Efficient Design and Analysis of Robust Power Distribution Meshes
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
Puneet Gupta, Andrew B. Kahng
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
16 years 6 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran