6575 search results - page 232 / 1315 » Specializing visualization algorithms |
172
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
181
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
175
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
160
click to vote
GEOINFORMATICA
2006
15 years 6 months ago
2006
In this paper a new method for the combination of 2D GIS vector data and 2.5D DTM represented by triangulated irregular networks (TIN) to derive integrated triangular 2.5D object-b...
261
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...