Sciweavers

5595 search results - page 930 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
BMCBI
2007
144views more  BMCBI 2007»
15 years 6 months ago
Automatic delineation of malignancy in histopathological head and neck slides
Background: Histopathology, which is one of the most important routines of all laboratory procedures used in pathology, is decisive for the diagnosis of cancer. Experienced histop...
Mutlu Mete, Xiaowei Xu, Chun-Yang Fan, Gal Shafirs...
226
Voted
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
13 years 8 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
15 years 12 months ago
An Algebraic Geometry Approach to Protein Structure Determination from NMR Data
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...
Lincong Wang, Ramgopal R. Mettu, Bruce Randall Don...
163
Voted
PASTE
2004
ACM
15 years 11 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 11 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun