Sciweavers

786 search results - page 48 / 158
» An Efficient k-Means Clustering Algorithm: Analysis and Impl...
Sort
View
CASCON
1992
134views Education» more  CASCON 1992»
13 years 9 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons
APSCC
2008
IEEE
14 years 2 months ago
Integration and Implementation of Secured IP Based Surveillance Networks
— This paper presents a method of integration and implementation of transmitting video and audio data from multiple Internet Protocol (IP) surveillance cameras in a wireless sens...
Charles C. Castello, Jeffrey Fan, Te-Shun Chou, Ho...
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
14 years 9 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
VLDB
2003
ACM
156views Database» more  VLDB 2003»
14 years 8 months ago
Watermarking relational data: framework, algorithms and analysis
We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking, and de...
Rakesh Agrawal, Peter J. Haas, Jerry Kiernan
TCSV
2008
225views more  TCSV 2008»
13 years 8 months ago
Analysis and Efficient Architecture Design for VC-1 Overlap Smoothing and In-Loop Deblocking Filter
Abstract--In contrast to the macroblock-based in-loop deblocking filters, the filters of VC-1 perform all horizontal edges (for in-loop filtering) or vertical edges (for overlap sm...
Yen-Lin Lee, T. Q. Nguyen