Sciweavers

846 search results - page 149 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
ASPLOS
2008
ACM
13 years 10 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
HPDC
2003
IEEE
14 years 2 months ago
Distributed Pagerank for P2P Systems
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
Karthikeyan Sankaralingam, Simha Sethumadhavan, Ja...
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
14 years 1 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou
DAS
2010
Springer
14 years 23 days ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha
BMCBI
2006
112views more  BMCBI 2006»
13 years 8 months ago
A correlated motif approach for finding short linear motifs from protein interaction networks
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
Soon-Heng Tan, Hugo Willy, Wing-Kin Sung, See-Kion...