Sciweavers

6274 search results - page 569 / 1255
» From query complexity to computational complexity
Sort
View
SPAA
2004
ACM
16 years 16 days ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
IR
2007
15 years 7 months ago
Searching strategies for the Bulgarian language
This paper reports on the underlying IR problems encountered when indexing and searching with the Bulgarian language. For this language we propose a general light stemmer and demon...
Jacques Savoy
BMCBI
2006
184views more  BMCBI 2006»
15 years 7 months ago
PathSys: integrating molecular interaction graphs for systems biology
Background: The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low th...
Michael Baitaluk, Xufei Qian, Shubhada Godbole, Al...
STACS
2010
Springer
16 years 2 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
ECCB
2002
IEEE
16 years 2 days ago
Stochastic roadmap simulation for the study of ligand-protein interactions
The dynamics of ligand-protein interactions are necessary to understand for the design of novel therapeutic agents. In this paper, we establish the use of Stochastic Roadmap Simul...
Mehmet Serkan Apaydin, Carlos Guestrin, Chris Varm...