Sciweavers

5372 search results - page 203 / 1075
» complexity 2007
Sort
View
JIPS
2007
131views more  JIPS 2007»
13 years 8 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong
ACTA
2002
111views more  ACTA 2002»
13 years 8 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
MAGS
2007
100views more  MAGS 2007»
13 years 8 months ago
Engineering agent-mediated integration of bioinformatics analysis tools
Abstract. The availability of massive amounts of biological data, distributed in various data sources, has prompted the development of a wide range of data analysis tools. However,...
Vassilis Koutkias, Andigoni Malousi, Nicos Maglave...
AAI
2000
122views more  AAI 2000»
13 years 8 months ago
High-Level Interpretation in Virtual Environments
: As Virtual Environments applications become more complex, there is a need to interpret user interaction in terms of high-level concepts. In this paper, we investigate the relatio...
Marc Cavazza, Ian Palmer
EJC
2002
13 years 7 months ago
Bases in Orlik-Solomon Type Algebras
The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal (M) generated by the boundaries of the circuits of the matroid. There i...
David Forge