9871 search results - page 101 / 1975 » On the Structure of Low Sets |
170
click to vote
VLDB
1987
ACM
15 years 9 months ago
1987
ACM
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
172
click to vote
NIPS
2001
15 years 7 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
184
click to vote
ML
2010
ACM
15 years 4 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
159
click to vote
TSE
2011
15 years 1 months ago
2011
Software module clustering is the problem of automatically organising software units into modules to improve program structure. There has been a great deal of recent interest in s...
156
click to vote
VMCAI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets. In our a...