Sciweavers

1257 search results - page 33 / 252
» A generalization of Euler's constant
Sort
View
JSCIC
2006
81views more  JSCIC 2006»
13 years 8 months ago
An Improvement of a Recent Eulerian Method for Solving PDEs on General Geometries
We improve upon a method introduced in (Bertalmio et. al. JCP 2001) for solving evolution PDEs on codimension-one surfaces in RN. As in the original method, by representing the su...
John B. Greer
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
13 years 10 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
IPPS
1999
IEEE
14 years 1 months ago
Fully-Scalable Fault-Tolerant Simulations for BSP and CGM
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The faults are deterministic (i...
Sung-Ryul Kim, Kunsoo Park
CRYPTO
2006
Springer
99views Cryptology» more  CRYPTO 2006»
14 years 14 days ago
Scalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Ivan Damgård, Yuval Ishai
COMGEO
2011
ACM
13 years 3 months ago
A note on the perimeter of fat objects
In this note, we show that the size of the perimeter of (α, β)-covered objects is a linear function of the diameter. Specifically, for an (α, β)-covered object O, per(O) ≤ c...
Prosenjit Bose, Otfried Cheong, Vida Dujmovic