5214 search results - page 269 / 1043 » The Online Specialization Problem |
136
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
This paper describes in outline a method for translating Japanese temporal expressions into English. We argue that temporal expressions form a special subset of language that is be...
132
click to vote
DAM
1998
15 years 5 months ago
1998
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time sca...
171
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
167
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
123
click to vote
ICMCS
2007
IEEE
16 years 15 days ago
2007
IEEE
Instead of computer games, animations, cartoons, and videos being used only for entertainment by kids, there is now an interest in using multimedia for “innovative testing.” R...