4047 search results - page 290 / 810 » Some Properties and Some Problems on Set Functors |
191
click to vote
TCOM
2008
15 years 6 months ago
2008
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...
174
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
163
click to vote
ISMIS
1999
Springer
15 years 10 months ago
1999
Springer
Software quality prediction can be cast as a concept learning problem. In this paper, we discuss the full cycle of an application of Machine Learning to software quality predictio...
150
click to vote
EOR
2010
15 years 6 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
180
click to vote
JCT
2011
15 years 1 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...