Sciweavers

157 search results - page 26 / 32
» A Simple Algorithm for Finding Exact Common Repeats
Sort
View
WWW
2009
ACM
14 years 7 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
SIAMIS
2010
176views more  SIAMIS 2010»
13 years 5 months ago
Optimized Conformal Surface Registration with Shape-based Landmark Matching
Surface registration, which transforms different sets of surface data into one common reference space, is an important process which allows us to compare or integrate the surface ...
Lok Ming Lui, Sheshadri R. Thiruvenkadam, Yalin Wa...
ATAL
2010
Springer
13 years 7 months ago
Optimal temporal decoupling in multiagent systems
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
Léon Planken, Mathijs de Weerdt, Cees Witte...
BMCBI
2005
84views more  BMCBI 2005»
13 years 6 months ago
A method of precise mRNA/DNA homology-based gene structure prediction
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...
Alexander G. Churbanov, Mark Pauley, Daniel Quest,...
TSP
2008
151views more  TSP 2008»
13 years 6 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar