Sciweavers

112 search results - page 22 / 23
» Improved algorithms for hypergraph bipartitioning
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Multi-view clustering with constraint propagation for learning with an incomplete mapping between views
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...
Eric Eaton, Marie desJardins, Sara Jacob
ICCAD
2005
IEEE
125views Hardware» more  ICCAD 2005»
14 years 3 months ago
Robust mixed-size placement under tight white-space constraints
A novel and very simple correct-by-construction top-down methodology for high-utilization mixed-size placement is presented. The PolarBear algorithm combines recursive cutsize-dri...
Jason Cong, Michail Romesis, Joseph R. Shinnerl
PPOPP
2010
ACM
14 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
SIGIR
2009
ACM
14 years 1 months ago
Entropy-biased models for query representation on the click graph
Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Hongbo Deng, Irwin King, Michael R. Lyu
APCSAC
2005
IEEE
14 years 6 days ago
An Integrated Partitioning and Scheduling Based Branch Decoupling
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate th...
Pramod Ramarao, Akhilesh Tyagi