513 search results - page 65 / 103 » Finitely Based, Finite Sets of Words |
JSYML
2010
14 years 6 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
206
click to vote
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
MFCS
1998
Springer
15 years 4 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
EOR
2008
14 years 12 months ago
2008
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
107
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Abstract--In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integr...