Sciweavers

2944 search results - page 288 / 589
» Improving Bound Propagation
Sort
View
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 6 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
185
Voted
CORR
2008
Springer
189views Education» more  CORR 2008»
15 years 6 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
DAM
2010
111views more  DAM 2010»
15 years 6 months ago
Covering line graphs with equivalence relations
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
Louis Esperet, John Gimbel, Andrew King
EOR
2008
103views more  EOR 2008»
15 years 6 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
CAD
2007
Springer
15 years 6 months ago
Error analysis of reparametrization based approaches for curve offsetting
This paper proposes an error analysis of reparametrization based approaches for planar curve offsetting. The approximation error in Hausdorff distance is computed. The error is bo...
Hong-Yan Zhao, Guo-Jin Wang