2681 search results - page 231 / 537 » Problem F |
106
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
119
Voted
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
126
click to vote
MOBICOM
2004
ACM
15 years 7 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
104
click to vote
SIGECOM
2004
ACM
15 years 7 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
128
click to vote
INFOVIS
2003
IEEE
15 years 7 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...