5624 search results - page 149 / 1125 » On Conditional Covering Problem |
206
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
186
click to vote
FGR
2004
IEEE
15 years 10 months ago
2004
IEEE
Data collection for both training and testing a classifier is a tedious but essential step towards face detection and recognition. All of the statistical methods suffer from this ...
191
click to vote
Lecture Notes
These lecture notes cover several topics such as Abstract Preferences and Choices, A Choice Structure Approach to Consumer Demand, A Preference Based Approach to Consumer Demand
P...
162
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
151
click to vote
CCCG
2010
15 years 7 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...