Sciweavers

148 search results - page 27 / 30
» Linear Time Algorithm for the Longest Common Repeat Problem
Sort
View
IDA
2009
Springer
13 years 5 months ago
Estimating Hidden Influences in Metabolic and Gene Regulatory Networks
We address the applicability of blind source separation (BSS) methods for the estimation of hidden influences in biological dynamic systems such as metabolic or gene regulatory net...
Florian Blöchl, Fabian J. Theis
TSP
2008
79views more  TSP 2008»
13 years 7 months ago
New Blind Block Synchronization for Transceivers Using Redundant Precoders
This paper studies the blind block synchronization problem in block transmission systems using linear redundant precoders (LRP). Two commonly used LRP systems, namely, zero padding...
Borching Su, P. P. Vaidyanathan
AI
2002
Springer
13 years 7 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
WWW
2009
ACM
14 years 8 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...
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 2 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...