Sciweavers

486 search results - page 34 / 98
» Improved upper bounds for 3-SAT
Sort
View
JAPLL
2010
133views more  JAPLL 2010»
13 years 7 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
TRANSCI
2010
101views more  TRANSCI 2010»
13 years 6 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
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
14 years 9 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
CORR
2008
Springer
189views Education» more  CORR 2008»
13 years 8 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
ETT
2007
99views Education» more  ETT 2007»
13 years 8 months ago
On the design of rate-compatible serially concatenated convolutional codes
A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the ...
Alexandre Graell i Amat, Fredrik Brännstr&oum...