526 search results - page 87 / 106 » Increments of Random Partitions |
140
Voted
COMPSAC
1999
IEEE
15 years 7 months ago
1999
IEEE
Design patterns have been used in object-oriented frameworks such as the IBM San Francisco framework, Apple's Rhaspody, OpenStep, and WebObjects, and DIWB. However, few guide...
112
Voted
EUROCRYPT
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
127
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
139
Voted
EWCBR
2006
Springer
15 years 6 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
132
Voted
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...