Sciweavers

958 search results - page 54 / 192
» Resolving the Micropayment Problem
Sort
View
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
13 years 10 days ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
BMCBI
2006
100views more  BMCBI 2006»
14 years 10 months ago
DNPTrapper: an assembly editing tool for finishing and analysis of complex repeat regions
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...
Erik Arner, Martti T. Tammi, Anh-Nhi Tran, Ellen K...
TMC
2008
161views more  TMC 2008»
14 years 9 months ago
A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks
Abstract--In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the locationdependent contention may cause serious unfairness an...
Ping Wang, Hai Jiang, Weihua Zhuang
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
15 years 4 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
LATIN
2010
Springer
14 years 8 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese