Sciweavers

1213 search results - page 174 / 243
» Approximation in quantale-enriched categories
Sort
View
CIKM
2010
Springer
15 years 3 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CGF
2010
182views more  CGF 2010»
15 years 2 months ago
A Data-driven Segmentation for the Shoulder Complex
The human shoulder complex is perhaps the most complicated joint in the human body being comprised of a set of three bones, muscles, tendons, and ligaments. Despite this anatomica...
Q. Youn Hong, Sang Il Park, Jessica K. Hodgins
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
14 years 3 days ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
153
Voted
WSDM
2012
ACM
254views Data Mining» more  WSDM 2012»
14 years 2 days ago
Maximizing product adoption in social networks
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
Smriti Bhagat, Amit Goyal 0002, Laks V. S. Lakshma...
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 7 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park