1631 search results - page 113 / 327 » Uniform Distributed Synthesis |
85
Voted
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
113
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
105
Voted
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
127
click to vote
LSSC
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
121
Voted
COMPSAC
1998
IEEE
15 years 6 months ago
1998
IEEE
Protection is an essential issue for the kind of heterogeneous distributed interoperable object environments, which Java and CORBA are a glimpse of. A uniform protection mechanism...