Sciweavers

2932 search results - page 286 / 587
» Higher order mining
Sort
View
COMGEO
2011
ACM
15 years 1 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
ICASSP
2010
IEEE
15 years 1 months ago
A low complexity speck-based codec for multispectral fluorescence microscopic images
The distortion scalable wavelet based coder SPECK is widely referred to in literature as achieving excellent coding performance with very low computational complexity compared to ...
Awais Mansoor, J. Paul Robinson, Bartek Rajwa
TVLSI
2010
15 years 1 months ago
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
Kanad Basu, Prabhat Mishra
SIGSOFT
2007
ACM
16 years 7 months ago
Training on errors experiment to detect fault-prone software modules by spam filter
The fault-prone module detection in source code is of importance for assurance of software quality. Most of previous fault-prone detection approaches are based on software metrics...
Osamu Mizuno, Tohru Kikuno
KDD
1999
ACM
166views Data Mining» more  KDD 1999»
15 years 11 months ago
CACTUS - Clustering Categorical Data Using Summaries
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...