Sciweavers

2693 search results - page 84 / 539
» On Computing Complex Navigation Functions
Sort
View
IACR
2011
127views more  IACR 2011»
14 years 5 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
PVLDB
2008
123views more  PVLDB 2008»
15 years 5 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
GD
2005
Springer
15 years 11 months ago
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
Seok-Hee Hong
IC
2003
15 years 7 months ago
Remote Real Laboratory: Linux Installation and Configuration
: Remote real laboratories deal with performing real lab experiments remotely via Internet. Recent advances in Internet/web technologies and computer-controlled instrumentation all...
Alassane Diop, Amine Berqia, Jürgen Harms
ICTAC
2005
Springer
15 years 11 months ago
Maximum Marking Problems with Accumulative Weight Functions
We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speci...
Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu