Sciweavers

5606 search results - page 255 / 1122
» Randomization Techniques for Graphs.
Sort
View
LCTRTS
2005
Springer
15 years 12 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...
DEXA
2004
Springer
136views Database» more  DEXA 2004»
15 years 12 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 8 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
DAC
2003
ACM
16 years 7 months ago
Random walks in a supply network
This paper presents a power grid analyzer based on a random walk technique. A linear-time algorithm is first demonstrated for DC analysis, and is then extended to perform transien...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar
VTC
2007
IEEE
16 years 22 days ago
Time Slot Partitioning and Random Data Hopping for TDD Based Multihop Wireless Networks
Abstract— A multihop ad hoc wireless network with an interference avoidance model is analyzed for a time division duplex (TDD) air-interface. In accordance with the non-interfere...
Hrishikesh Venkataraman, Abdurazak Mudesir, Sinan ...