2835 search results - page 422 / 567 » Automatic Question Answering |
144
click to vote
ARSCOM
2008
15 years 6 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
146
click to vote
CE
2008
15 years 6 months ago
2008
Despite the assumption that the integration of ICT influences the entire school system, research focusing on ICT in schools is generally limited to the study of variables at class...
202
click to vote
CGF
2008
15 years 6 months ago
2008
Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations...
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In his book "Mathematical Mind-Benders", Peter Winkler poses the following open problem, originally due to the first author: "[In the game Peer Pressure,] two player...
204
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...