Sciweavers

4781 search results - page 38 / 957
» Complexity at large
Sort
View
CJTCS
1999
133views more  CJTCS 1999»
13 years 7 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
PDC
2004
ACM
14 years 1 months ago
From small scale to large scale user participation: a case study of participatory design in e-government systems
Most experiments with participative design are with small scale, stand alone and not very strategic applications of ICT in organizations. However, modern ICT applications are incr...
Anne-Marie Oostveen, Peter Van den Besselaar
AAAI
1997
13 years 9 months ago
Efficient Management of Very Large Ontologies
This paper describes an environment for supporting very large ontologies. The system can be used on single PCs, workstations, a cluster of workstations, and high-end parallel supe...
Kilian Stoffel, Merwyn G. Taylor, James A. Hendler
BMCBI
2008
95views more  BMCBI 2008»
13 years 7 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri
ORL
2006
118views more  ORL 2006»
13 years 7 months ago
On complexity of multistage stochastic programs
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
Alexander Shapiro