14548 search results - page 2467 / 2910 » The Optimal Path-Matching Problem |
186
click to vote
JSSPP
2005
Springer
16 years 10 days ago
2005
Springer
Recently HP Labs engaged in a joint project with DreamWorks Animation to develop a Utility Rendering Service that was used to render part of the computer-animated feature film Shr...
215
click to vote
VLDB
2005
ACM
16 years 10 days ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
194
click to vote
DIGITALCITIES
2003
Springer
16 years 2 days ago
2003
Springer
In order to utilize geographic web information for digital city applications, we have been developing a geographic web search system, KyotoSEARCH. When users retrieve geographic in...
188
click to vote
ICALP
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
187
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...