Sciweavers

136 search results - page 21 / 28
» Experimental Study of Minimum Cut Algorithms
Sort
View
73
Voted
ISCAS
2003
IEEE
76views Hardware» more  ISCAS 2003»
15 years 3 months ago
Loop scheduling for minimizing schedule length and switching activities
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activitie...
Zili Shao, Qingfeng Zhuge, Edwin Hsing-Mean Sha, C...
DAC
1996
ACM
15 years 1 months ago
Structural Gate Decomposition for Depth-Optimal Technology Mapping in LUT-based FPGA Design
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
Jason Cong, Yean-Yow Hwang
CIKM
2010
Springer
14 years 8 months ago
Document allocation policies for selective searching of distributed indexes
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
Anagha Kulkarni, Jamie Callan
PVLDB
2011
14 years 4 months ago
Personalized Social Recommendations - Accurate or Private?
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
Ashwin Machanavajjhala, Aleksandra Korolova, Atish...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 4 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...