Sciweavers

502 search results - page 57 / 101
» Verifying Balanced Trees
Sort
View
FCCM
2008
IEEE
153views VLSI» more  FCCM 2008»
14 years 4 months ago
A SRAM-based Architecture for Trie-based IP Lookup Using FPGA
Internet Protocol (IP) lookup in routers can be implemented by some form of tree traversal. Pipelining can dramatically improve the search throughput. However, it results in unbal...
Hoang Le, Weirong Jiang, Viktor K. Prasanna
AISADM
2005
Springer
14 years 3 months ago
Execution Engine of Meta-learning System for KDD in Multi-agent Environment
Meta-learning system for KDD is an open and evolving platform for efficient testing and intelligent recommendation of data mining process. Metalearning is adopted to automate the s...
Ping Luo, Qing He, Rui Huang, Fen Lin, Zhongzhi Sh...
HPCC
2005
Springer
14 years 3 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
WAOA
2004
Springer
111views Algorithms» more  WAOA 2004»
14 years 3 months ago
More Powerful and Simpler Cost-Sharing Methods
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
Paolo Penna, Carmine Ventre
COMPSAC
2002
IEEE
14 years 2 months ago
Achieving Scalability in Hierarchical Location Services
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
Maarten van Steen, Gerco Ballintijn