Sciweavers

3937 search results - page 733 / 788
» Questioning Ubiquitous Computing
Sort
View
BIRTHDAY
2010
Springer
13 years 9 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
CONCUR
2010
Springer
13 years 9 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
BIODATAMINING
2008
147views more  BIODATAMINING 2008»
13 years 8 months ago
Neural networks for genetic epidemiology: past, present, and future
During the past two decades, the field of human genetics has experienced an information explosion. The completion of the human genome project and the development of high throughpu...
Alison A. Motsinger-Reif, Marylyn D. Ritchie
BMCBI
2007
158views more  BMCBI 2007»
13 years 8 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 7 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira