Sciweavers

6409 search results - page 683 / 1282
» A Computational Algorithm for Origami Design
Sort
View
WWW
2009
ACM
16 years 1 months ago
Tagommenders: connecting users to items through tags
Tagging has emerged as a powerful mechanism that enables users to find, organize, and understand online entities. Recommender systems similarly enable users to efficiently navig...
Shilad Sen, Jesse Vig, John Riedl
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 11 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
DAC
2007
ACM
16 years 7 months ago
RQL: Global Placement via Relaxed Quadratic Spreading and Linearization
This paper describes a simple and effective quadratic placement algorithm called RQL. We show that a good quadratic placement, followed by local wirelength-driven spreading can pr...
Natarajan Viswanathan, Gi-Joon Nam, Charles J. Alp...
DAC
2005
ACM
16 years 7 months ago
Multilevel full-chip routing for the X-based architecture
As technology advances into the nanometer territory, the interconnect delay has become a first-order effect on chip performance. To handle this effect, the X-architecture has been...
Tsung-Yi Ho, Chen-Feng Chang, Yao-Wen Chang, Sao-J...
MOBICOM
2006
ACM
16 years 12 days ago
Robust rate adaptation for 802.11 wireless networks
Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploiting the multi-rate capability at the physical layer. In this ...
Starsky H. Y. Wong, Songwu Lu, Hao Yang, Vaduvur B...