Sciweavers

2542 search results - page 145 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
15 years 8 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
DEXA
2005
Springer
148views Database» more  DEXA 2005»
15 years 8 months ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
AAAI
2006
15 years 4 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICPADS
2005
IEEE
15 years 8 months ago
A Model for Distributing and Querying a Data Warehouse on a Computing Grid
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
Pascal Wehrle, Maryvonne Miquel, Anne Tchounikine
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
15 years 3 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...