Sciweavers

541 search results - page 62 / 109
» Applications of nonstandard analysis in additive number theo...
Sort
View
DMIN
2006
134views Data Mining» more  DMIN 2006»
13 years 10 months ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 9 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
IWCMC
2006
ACM
14 years 2 months ago
Distributed obstacle localization in large wireless sensor networks
Obstacles are but pleasing for many aspects of large realworld sensor networks. Among other things, the presence of obstacles distort the sensor node localization process and migh...
Frank Reichenbach, Ralf Salomon, Dirk Timmermann
PDP
2005
IEEE
14 years 2 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...