Sciweavers

1712 search results - page 11 / 343
» A Computational Approach to Binding Theory
Sort
View
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 2 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
BMCBI
2007
145views more  BMCBI 2007»
14 years 11 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
BIOINFORMATICS
2012
13 years 2 months ago
Epigenetic priors for identifying active transcription factor binding sites
Motivation Accurate knowledge of the genome-wide binding of transcription factors in a particular cell type or under a particular condition is necessary for understanding transcri...
Gabriel Cuellar-Partida, Fabian A. Buske, Robert C...
DAC
2004
ACM
16 years 21 days ago
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
Chun-Gi Lyuh, Taewhan Kim
MIDDLEWARE
2005
Springer
15 years 5 months ago
Functional and architectural adaptation in pervasive computing environments
Service-oriented computing paradigm encourages the use of dynamic binding of application requirements to the resources needed to fulfill application tasks. Especially in pervasive...
Nanjangud C. Narendra, Umesh Bellur, S. K. Nandy, ...