Sciweavers

230 search results - page 44 / 46
» A Linear Time Algorithm for L(2, 1)-Labeling of Trees
Sort
View
APIN
2008
116views more  APIN 2008»
13 years 7 months ago
Updating generalized association rules with evolving taxonomies
Abstract-Mining generalized association rules between items in the presence of taxonomy has been recognized as an important model in data mining. Earlier work on mining generalized...
Ming-Cheng Tseng, Wen-Yang Lin, Rong Jeng
SPAA
2005
ACM
14 years 15 days ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
ASE
2005
137views more  ASE 2005»
13 years 6 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
SIGSOFT
2007
ACM
14 years 7 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
ICIP
1999
IEEE
14 years 8 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...