Sciweavers

845 search results - page 151 / 169
» Complexity Dimensions and Learnability
Sort
View
CN
1998
64views more  CN 1998»
13 years 8 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
13 years 8 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
BMCBI
2010
223views more  BMCBI 2010»
13 years 3 months ago
MetNetGE: interactive views of biological networks and ontologies
Background: Linking high-throughput experimental data with biological networks is a key step for understanding complex biological systems. Currently, visualization tools for large...
Ming Jia, Suh-Yeon Choi, Dirk Reiners, Eve Syrkin ...
ICA
2012
Springer
12 years 4 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
ICCV
2009
IEEE
15 years 1 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...