Sciweavers

1369 search results - page 70 / 274
» Lattice computations for random numbers
Sort
View
ECCV
2008
Springer
16 years 3 months ago
Hierarchical Support Vector Random Fields: Joint Training to Combine Local and Global Features
Abstract. Recently, impressive results have been reported for the detection of objects in challenging real-world scenes. Interestingly however, the underlying models vary greatly e...
Paul Schnitzspan, Mario Fritz, Bernt Schiele
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
16 years 2 months ago
Randomized Synopses for Query Assurance on Data Streams
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
Ke Yi, Feifei Li, Marios Hadjieleftheriou, George ...
CSL
2006
Springer
15 years 5 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 2 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
IACR
2011
196views more  IACR 2011»
14 years 1 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs