Sciweavers

4150 search results - page 510 / 830
» A Practical Approach to Model Extension
Sort
View
BMCBI
2008
136views more  BMCBI 2008»
15 years 5 months ago
An efficient method for the prediction of deleterious multiple-point mutations in the secondary structure of RNAs using suboptim
Background: RNAmute is an interactive Java application which, given an RNA sequence, calculates the secondary structure of all single point mutations and organizes them into categ...
Alexander Churkin, Danny Barash
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 4 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
PVLDB
2010
91views more  PVLDB 2010»
15 years 3 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
140
Voted
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 2 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
P2P
2008
IEEE
15 years 11 months ago
Peer-to-Peer Secure Multi-party Numerical Computation
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
Danny Bickson, Danny Dolev, Genia Bezman, Benny Pi...