Sciweavers

340 search results - page 66 / 68
» Linear Dependent Dimensionality Reduction
Sort
View
MOBIHOC
2009
ACM
14 years 8 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
Combining classifiers to predict gene function in Arabidopsis thaliana using large-scale gene expression measurements
Background: Arabidopsis thaliana is the model species of current plant genomic research with a genome size of 125 Mb and approximately 28,000 genes. The function of half of these ...
Hui Lan, Rachel Carson, Nicholas J. Provart, Antho...
PR
2010
145views more  PR 2010»
13 years 5 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 1 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 1 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál