Sciweavers

1071 search results - page 28 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
IJCBDD
2010
127views more  IJCBDD 2010»
13 years 6 months ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 7 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
ICML
2009
IEEE
14 years 8 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
DCG
2010
121views more  DCG 2010»
13 years 5 months ago
Compression Schemes, Stable Definable Families, and o-Minimal Structures
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
H. R. Johnson, M. C. Laskowski
CEC
2008
IEEE
14 years 2 months ago
Automatic model type selection with heterogeneous evolution: An application to RF circuit block modeling
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...
Dirk Gorissen, Luciano De Tommasi, Jeroen Croon, T...