Sciweavers

921 search results - page 13 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
ANCS
2009
ACM
14 years 9 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
ICDCS
2009
IEEE
15 years 9 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
CSDA
2006
83views more  CSDA 2006»
14 years 11 months ago
Linear grouping using orthogonal regression
A new method to detect different linear structures in a data set, called Linear Grouping Algorithm (LGA), is proposed. LGA is useful for investigating potential linear patterns in...
Stefan Van Aelst, Xiaogang Wang, Ruben H. Zamar, R...
MICRO
2008
IEEE
146views Hardware» more  MICRO 2008»
14 years 11 months ago
A small cache of large ranges: Hardware methods for efficiently searching, storing, and updating big dataflow tags
Dynamically tracking the flow of data within a microprocessor creates many new opportunities to detect and track malicious or erroneous behavior, but these schemes all rely on the...
Mohit Tiwari, Banit Agrawal, Shashidhar Mysore, Jo...
ICPR
2002
IEEE
16 years 24 days ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang