Sciweavers

4315 search results - page 238 / 863
» Sorting in linear time
Sort
View
TRANSCI
2010
101views more  TRANSCI 2010»
13 years 8 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu
WCNC
2010
IEEE
13 years 8 months ago
Sensing and Communication Tradeoff for Cognitive Access of Continues-Time Markov Channels
—Dynamic spectrum access (DSA) aims to improve spectrum efficiency via spectrum sensing and optimal spectrum access. An essential component in DSA is the joint design of sensing...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 10 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
POPL
2010
ACM
14 years 7 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
BMCBI
2007
133views more  BMCBI 2007»
13 years 9 months ago
An efficient pseudomedian filter for tiling microrrays
Background: Tiling microarrays are becoming an essential technology in the functional genomics toolbox. They have been applied to the tasks of novel transcript identification, elu...
Thomas E. Royce, Nicholas Carriero, Mark B. Gerste...