Sciweavers

858 search results - page 132 / 172
» An Efficient Spatial Search Method Based on SG-Tree
Sort
View
EUROGRAPHICS
2010
Eurographics
13 years 10 months ago
Contrast-aware Halftoning
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
Hua Li and David Mould
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 9 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 9 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
BMCBI
2007
166views more  BMCBI 2007»
13 years 9 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
RECOMB
2005
Springer
14 years 9 months ago
Recognition of Binding Patterns Common to a Set of Protein Structures
We present a novel computational method, MultiBind, for recognition of binding patterns common to a set of protein structures. It is the first method which performs a multiple alig...
Maxim Shatsky, Alexandra Shulman-Peleg, Ruth Nussi...