Sciweavers

165 search results - page 25 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
163
Voted
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
15 years 11 months ago
Graph Database Indexing Using Structured Graph Decomposition
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
David W. Williams, Jun Huan, Wei Wang 0010
94
Voted
WCNC
2010
IEEE
14 years 8 months ago
A Recursive Battery Model for Nodes Lifetime Estimation in Wireless Sensor Networks
—Since sensor nodes use batteries as their source of energy, energy-based routing becomes an important requirement to extend network lifetime. This routing is done using the node...
Joseph Rahmé, Nicolas Fourty, Khaldoun Al A...
FPGA
2000
ACM
161views FPGA» more  FPGA 2000»
15 years 1 months ago
The effect of LUT and cluster size on deep-submicron FPGA performance and density
In this paper we revisit the FPGA architectural issue of the effect of logic block functionality on FPGA performance and density. In particular, in the context of lookup table, cl...
Elias Ahmed, Jonathan Rose
127
Voted
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
SIGCOMM
1998
ACM
15 years 2 months ago
Fast and Scalable Layer Four Switching
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
Venkatachary Srinivasan, George Varghese, Subhash ...