Sciweavers

105 search results - page 13 / 21
» nn 2010
Sort
View
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
14 years 8 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
SADM
2010
196views more  SADM 2010»
14 years 4 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
BMCBI
2010
126views more  BMCBI 2010»
14 years 9 months ago
Antisense DNA parameters derived from next-nearest-neighbor analysis of experimental data
Background: The enumeration of tetrameric and other sequence motifs that are positively or negatively correlated with in vivo antisense DNA effects has been a useful addition to t...
Donald M. Gray, Carla W. Gray, Byong-Hoon Yoo, Tzu...
NN
2010
Springer
143views Neural Networks» more  NN 2010»
14 years 8 months ago
Neural network model for completing occluded contours
— This paper proposes a neural network model capable of completing partly occluded contours. The model is a hierarchical multi-layered network. Using the responses of bend-extrac...
Kunihiko Fukushima
LREC
2010
126views Education» more  LREC 2010»
14 years 11 months ago
Predictive Features for Detecting Indefinite Polar Sentences
In recent years, text classification in sentiment analysis has mostly focused on two types of classification, the distinction between objective and subjective text, i.e. subjectiv...
Michael Wiegand, Dietrich Klakow