Sciweavers

2702 search results - page 489 / 541
» constraints 2008
Sort
View
IFIP3
1998
151views Education» more  IFIP3 1998»
14 years 11 months ago
Conceptual Workflow Modelling for Remote Courses
Development of a wide spread project intended to teaching Computer Science, integrating a considerable number of students all over a country with big geographical extension and sc...
José Palazzo M. de Oliveira, Mariano Nicola...
UAI
1997
14 years 11 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
COLING
1996
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
COMAD
2009
14 years 11 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
BMCBI
2008
90views more  BMCBI 2008»
14 years 10 months ago
Genome-scale study of the importance of binding site context for transcription factor binding and gene regulation
Background: The rate of mRNA transcription is controlled by transcription factors that bind to specific DNA motifs in promoter regions upstream of protein coding genes. Recent res...
Jakub Orzechowski Westholm, Feifei Xu, Hans Ronne,...