Sciweavers

6202 search results - page 124 / 1241
» Without Loss of Generality
Sort
View
JOC
2000
95views more  JOC 2000»
14 years 10 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
SECON
2007
IEEE
15 years 4 months ago
Foxtrot: phase space data representation for correlation-aware aggregation
Abstract— Most existing work in aggregation and querying for sensor network data has focused on the use of standard statistical operations (average, median, etc) to reduce the qu...
Tom Parker, Koen Langendoen
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 10 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ICONIP
2007
15 years 2 hour ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
IUI
2009
ACM
15 years 7 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu