Sciweavers

1071 search results - page 187 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
15 years 10 months ago
Testing juntas nearly optimally
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 ...
Eric Blais
CIBCB
2007
IEEE
15 years 4 months ago
Modeling protein-DNA binding time in Stochastic Discrete Event Simulation of Biological Processes
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 ...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
SIGIR
2005
ACM
15 years 3 months ago
A study of relevance propagation for web search
Different from traditional information retrieval, both content and structure are critical to the success of Web information retrieval. In recent years, many relevance propagation ...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, Zheng Chen, W...
SPAA
2010
ACM
15 years 2 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
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...
Vijay Anand Korthikanti, Gul Agha
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 2 months ago
A poset framework to model decentralized control problems
— 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...
Parikshit Shah, Pablo A. Parrilo