Sciweavers

2754 search results - page 108 / 551
» Distributed Weighted Matching
Sort
View
ESANN
2000
14 years 10 days ago
Self-Organisation in the SOM with a finite number of possible inputs
Abstract. Given a one dimensional SOM with a monotonically decreasing neighbourhood and an input distribution which is not Lebesque continuous, a set of su cient conditions and a T...
John A. Flanagan
SPAA
2005
ACM
14 years 4 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
AIRS
2004
Springer
14 years 4 months ago
X-IOTA: An Open XML Framework for IR Experimentation
Carrying out experiments in Information Retrieval is a heavy activity requiring fast tools to treat collections of significant size, and at the same time flexible tools to leave...
Jean-Pierre Chevallet
SIGMOD
2004
ACM
112views Database» more  SIGMOD 2004»
14 years 11 months ago
Matching Large XML Schemas
Current schema matching approaches still have to improve for very large and complex schemas. Such schemas are increasingly written in the standard language W3C XML schema, especia...
Erhard Rahm, Hong Hai Do, Sabine Massmann
FCCM
2004
IEEE
96views VLSI» more  FCCM 2004»
14 years 2 months ago
Pre-Decoded CAMs for Efficient and High-Speed NIDS Pattern Matching
In this paper we advocate the use of pre-decoding for CAM-based pattern matching. We implement an FPGA based sub-system for NIDS (Snort) pattern matching using a combination of te...
Ioannis Sourdis, Dionisios N. Pnevmatikatos