1071 search results - page 187 / 215 » Theories of Automatic Structures and Their Complexity |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
CIBCB
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
SIGIR
2005
ACM
14 years 1 months ago
2005
ACM
Different from traditional information retrieval, both content and structure are critical to the success of Web information retrieval. In recent years, many relevance propagation ...
SPAA
2010
ACM
14 years 26 days ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
CDC
2009
IEEE
14 years 23 days ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...