4850 search results - page 576 / 970 » Approximate Data Structures with Applications |
227
Voted
BMCBI
2006
15 years 7 months ago
2006
Background: Many attempts are being made to understand biological subjects at a systems level. A major resource for these approaches are biological databases, storing manifold inf...
220
Voted
KDD
2008
ACM
16 years 8 months ago
2008
ACM
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
228
Voted
NN
2002
Springer
15 years 7 months ago
2002
Springer
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
208
click to vote
XSYM
2004
Springer
16 years 26 days ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
238
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...