12194 search results - page 2398 / 2439 » Numberings Optimal for Learning |
108
click to vote
EDBT
2008
ACM
15 years 2 months ago
2008
ACM
The mobile phone industry has reached a saturation point. With low growth rates and fewer new customers available to acquire, competition among mobile operators is now focused on ...
ESA
2008
Springer
15 years 2 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
125
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
EDM
2008
15 years 1 months ago
2008
Bayesian graphical models are commonly used to build student models from data. A number of standard algorithms are available to train Bayesian models from student skills assessment...
102
Voted
SIROCCO
2010
15 years 1 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...