Sciweavers

4536 search results - page 146 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
14 years 4 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han
VLDB
1998
ACM
147views Database» more  VLDB 1998»
14 years 1 months ago
Scalable Techniques for Mining Causal Structures
Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
Craig Silverstein, Sergey Brin, Rajeev Motwani, Je...
UAI
2001
13 years 10 months ago
Similarity Measures on Preference Structures, Part II: Utility Functions
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
Vu A. Ha, Peter Haddawy, John Miyamoto
ASUNAM
2011
IEEE
12 years 9 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh
FOCS
1992
IEEE
14 years 1 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...