587 search results - page 45 / 118 » On the Relative Sizes of Learnable Sets |
BMCBI
2007
14 years 9 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
108
click to vote
SSDBM
1999
IEEE
15 years 2 months ago
1999
IEEE
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
115
click to vote
SIGMOD
2012
ACM
13 years 4 days ago
2012
ACM
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
79
Voted
ASUNAM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We study information diffusion in real-life and synthetic dynamic networks, using well known threshold and cascade models of diffusion. Our test-bed is the communication network...