IJCAI
2003
13 years 6 months ago
2003
There have been many proposals to compute similarities between words based on their distributions in contexts. However, these approaches do not distinguish between synonyms and an...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
CCCG
2006
13 years 6 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
RSS
2007
13 years 6 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
DAGSTUHL
2007
13 years 6 months ago
2007
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
CCCG
2007
13 years 6 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
ANTS
2010
Springer
13 years 8 months ago
2010
Springer
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
AINA
2009
IEEE
13 years 9 months ago
2009
IEEE
Scientific applications like neuroscience data analysis are usually compute and data-intensive. With the use of the additional capacity offered by distributed resources and suitab...
EUROCRYPT
1999
Springer
13 years 9 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...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...