Sciweavers

7106 search results - page 379 / 1422
» Restricted Complexity, General Complexity
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Importance weighted active learning
We propose an importance weighting framework for actively labeling samples. This technique yields practical yet sound active learning algorithms for general loss functions. Experi...
Alina Beygelzimer, Sanjoy Dasgupta, John Langford
IJCNN
2006
IEEE
16 years 8 days ago
Spatiotemporal Pattern Recognition via Liquid State Machines
— The applicability of complex networks of spiking neurons as a general purpose machine learning technique remains open. Building on previous work using macroscopic exploration o...
Eric Goodman, Dan Ventura
MOBIHOC
2009
ACM
15 years 11 months ago
A state-based battery model for nodes' lifetime estimation in wireless sensor networks
We address the problem of estimating the remaining energy of a node battery in wireless sensor networks. To solve this issue, we provide an on-line battery model that requires lim...
Joseph Rahmé, Khaldoun Al Agha
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 10 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 10 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim