Sciweavers

27692 search results - page 107 / 5539
» Where is ...
Sort
View
ACSC
2010
IEEE
13 years 4 months ago
A batch algorithm for maintaining a topological order
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...
David J. Pearce, Paul H. J. Kelly
JMLR
2011
137views more  JMLR 2011»
13 years 3 months ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
ECCC
2010
103views more  ECCC 2010»
13 years 3 months ago
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, ...
IJAOM
2010
70views more  IJAOM 2010»
13 years 3 months ago
Technology selection in the presence of dual-role factors
Technologies have varied strengths and weaknesses which require careful assessment by the purchasers. One of the uses of Data Envelopment Analysis (DEA) is technology selection. T...
Reza Farzipoor Saen
ECCC
2011
187views ECommerce» more  ECCC 2011»
13 years 13 days ago
In Brute-Force Search of Correlation Bounds for Polynomials
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...
Frederic Green, Daniel Kreymer, Emanuele Viola