Sciweavers

1709 search results - page 30 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
CSE
2009
IEEE
15 years 9 months ago
Open Editing Algorithm: A Collaborative News Promotion Algorithm Based on Users' Voting History
—In social news services, selecting valuable and credible news content is one of the most important issues. In traditional journalism, a small number of people called editors sel...
Joonseong Ko, Kanghak Kim, Ohyeon Kweon, Jongwook ...
BMCBI
2007
143views more  BMCBI 2007»
15 years 2 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...
108
Voted
NIPS
2007
15 years 3 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...
ICASSP
2011
IEEE
14 years 6 months ago
Using F0 to constrain the unit selection Viterbi network
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
Alistair Conkie, Ann K. Syrdal
204
Voted
GIS
2005
ACM
16 years 3 months ago
In-network surface simplification for sensor fields
Recent research literature on sensor network databases has focused on finding ways to perform in-network aggregation of sensor readings to reduce the message cost. However, with t...
Brian Harrington, Yan Huang