Sciweavers

2498 search results - page 311 / 500
» Data Structures with Unpredictable Timing
Sort
View
NN
2002
Springer
115views Neural Networks» more  NN 2002»
15 years 6 months ago
A self-organising network that grows when required
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...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
16 years 8 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
VLDB
2007
ACM
164views Database» more  VLDB 2007»
16 years 6 months ago
A new intrusion detection system using support vector machines and hierarchical clustering
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
Latifur Khan, Mamoun Awad, Bhavani M. Thuraisingha...
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
16 years 15 days ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
IPPS
2002
IEEE
15 years 11 months ago
Implementing Associative Search and Responder Resolution
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
Meiduo Wu, Robert A. Walker, Jerry L. Potter