Sciweavers

11129 search results - page 1631 / 2226
» Modeling Search Computing Applications
Sort
View
STACS
1993
Springer
15 years 11 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
HPDC
2010
IEEE
15 years 8 months ago
Biocompute: towards a collaborative workspace for data intensive bio-science
The explosion of data in the biological community demands the development of more scalable and flexible portals for bioinformatic computation. To address this need, we put forth c...
Rory Carmichael, Patrick Braga-Henebry, Douglas Th...
BMCBI
2010
116views more  BMCBI 2010»
15 years 7 months ago
FiGS: a filter-based gene selection workbench for microarray data
Background: The selection of genes that discriminate disease classes from microarray data is widely used for the identification of diagnostic biomarkers. Although various gene sel...
Taeho Hwang, Choong-Hyun Sun, Taegyun Yun, Gwan-Su...
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 7 months ago
Emergence of Spontaneous Order Through Neighborhood Formation in Peer-to-Peer Recommender Systems
The advent of the Semantic Web necessitates paradigm shifts away from centralized client/server architectures towards decentralization and peer-to-peer computation, making the exi...
Ernesto Diaz-Aviles, Lars Schmidt-Thieme, Cai-Nico...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 5 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
« Prev « First page 1631 / 2226 Last » Next »