Sciweavers

1399 search results - page 230 / 280
» Multi-party Finite Computations
Sort
View
101
Voted
ICML
2003
IEEE
16 years 4 months ago
SimpleSVM
We present a fast iterative support vector training algorithm for a large variety of different formulations. It works by incrementally changing a candidate support vector set usin...
S. V. N. Vishwanathan, Alex J. Smola, M. Narasimha...
131
Voted
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 4 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
16 years 4 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
PERCOM
2008
ACM
16 years 3 months ago
Estimating the Energy Consumption in Pervasive Java-Based Systems
We define and evaluate a framework for estimating the energy consumption of pervasive Java-based software systems. The framework's primary objective is to enable an engineer ...
Chiyoung Seo, Sam Malek, Nenad Medvidovic
MOBIHOC
2002
ACM
16 years 3 months ago
Constructing minimum-energy broadcast trees in wireless ad hoc networks
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
Weifa Liang