Sciweavers

868 search results - page 163 / 174
» Finding Most Likely Solutions
Sort
View
BMCBI
2004
167views more  BMCBI 2004»
13 years 7 months ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...
CACM
1999
92views more  CACM 1999»
13 years 7 months ago
Putting OO Distributed Programming to Work
stractions underlying distributed computing. We attempted to keep our preaims at an abstract and general level. In this column, we make those claims more concrete. More precisely, ...
Pascal Felber, Rachid Guerraoui, Mohamed Fayad
PVLDB
2010
82views more  PVLDB 2010»
13 years 6 months ago
Record Linkage with Uniqueness Constraints and Erroneous Values
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
Songtao Guo, Xin Dong, Divesh Srivastava, Remi Zaj...
AIED
2009
Springer
13 years 5 months ago
Investigating the Effects of Social Goals in a Negotiation Game with Virtual Humans
Educational games may be particularly suited to teaching social learning skills with virtual humans. We investigate the importance of social goals and engaging social interactions ...
Amy Ogan, Vincent Aleven, Christopher Jones
ICALP
2011
Springer
12 years 11 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...