Sciweavers

880 search results - page 173 / 176
» The SLAM problem: a survey
Sort
View
BIRTHDAY
2010
Springer
14 years 10 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
FSTTCS
2008
Springer
14 years 10 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
SOUPS
2010
ACM
14 years 9 months ago
Improving users' security choices on home wireless networks
Home networks are common but notoriously difficult to setup and maintain. The difficulty users experience in setting up and maintaining their home network is problematic because o...
Justin T. Ho, David Dearman, Khai N. Truong
BMCBI
2010
150views more  BMCBI 2010»
14 years 9 months ago
Systematic calibration of a cell signaling network model
Background: Mathematical modeling is being applied to increasingly complex biological systems and datasets; however, the process of analyzing and calibrating against experimental ...
Kyoung Ae Kim, Sabrina L. Spencer, John G. Albeck,...
BMCBI
2008
97views more  BMCBI 2008»
14 years 9 months ago
Interrogating domain-domain interactions with parsimony based approaches
Background: The identification and characterization of interacting domain pairs is an important step towards understanding protein interactions. In the last few years, several met...
Katia S. Guimarães, Teresa M. Przytycka