Sciweavers

498 search results - page 89 / 100
» DESCRY: A Density Based Clustering Algorithm for Very Large ...
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
CBMS
2006
IEEE
14 years 1 months ago
Pre-Indexing for Fast Partial Shape Matching of Vertebrae Images
Fast retrieval of images from large databases especially from large medical image databases is of great interest to researchers. We have developed shape-based image retrieval syst...
Xiaoqian Xu, D. J. Lee, Sameer Antani, L. Rodney L...
ICNP
2003
IEEE
14 years 23 days ago
Resilient Peer-to-Peer Streaming
We consider the problem of distributing “live” streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attr...
Venkata N. Padmanabhan, Helen J. Wang, Philip A. C...
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
13 years 11 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu