Sciweavers

2600 search results - page 184 / 520
» Clustering with or without the Approximation
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 3 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
EMMCVPR
1997
Springer
15 years 10 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 10 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
TWC
2008
76views more  TWC 2008»
15 years 6 months ago
High Resolution 3-D Angle of Arrival Determination for Indoor UWB Multipath Propagation
Propagation measurements using a large array are used to study the angle of arrival (AOA) across the ultrawideband (UWB) frequency range of 3.1 to 10.6 GHz. A two-dimensional Unita...
Yongwei Zhang, Anthony K. Brown, Wasim Q. Malik, D...