Sciweavers

762 search results - page 123 / 153
» Finding SHA-1 Characteristics: General Results and Applicati...
Sort
View
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 8 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICCV
2007
IEEE
14 years 10 months ago
Gradient Feature Selection for Online Boosting
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...
Ting Yu, Xiaoming Liu 0002
KDD
2009
ACM
164views Data Mining» more  KDD 2009»
14 years 9 months ago
Social influence analysis in large-scale networks
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...
Jie Tang, Jimeng Sun, Chi Wang, Zi Yang
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 8 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...