Sciweavers

1399 search results - page 164 / 280
» New Algorithms for k-Center and Extensions
Sort
View
CASCON
1996
126views Education» more  CASCON 1996»
13 years 10 months ago
Inter-class testing of O-O software in the presence of polymorphism
This paper1 describes an algorithm for testing polymorphic interactions between classes in object-oriented (O-O) software. We propose an Augmented Object Relationship Diagram (AOR...
Amit M. Paradkar
ISCI
2008
116views more  ISCI 2008»
13 years 9 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
TIT
2008
74views more  TIT 2008»
13 years 8 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
CIKM
2010
Springer
13 years 7 months ago
Visual cube and on-line analytical processing of images
On-Line Analytical Processing (OLAP) has shown great success in many industry applications, including sales, marketing, management, financial data analysis, etc. In this paper, w...
Xin Jin, Jiawei Han, Liangliang Cao, Jiebo Luo, Bo...
NOSSDAV
2010
Springer
13 years 7 months ago
Reducing data request contentions for improved streaming quality
In P2P assisted multi-channel live streaming systems, it is commonly believed that in unpopular channels, quality degradation is due to the small number of participating peers wit...
Yao Liu, Fei Li, Lei Guo, Songqing Chen