1012 search results - page 86 / 203 » Segment intersection searching problems in general settings |
VISUALIZATION
1996
IEEE
15 years 4 months ago
1996
IEEE
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
WWW
2006
ACM
16 years 16 days ago
2006
ACM
Major search engines currently use the history of a user's actions (e.g., queries, clicks) to personalize search results. In this paper, we present a new personalized service...
WWW
2006
ACM
16 years 16 days ago
2006
ACM
In this paper, we define and study a novel search problem: Comparative Web Search (CWS). The task of CWS is to seek relevant and comparative information from the Web to help users...
PODC
2010
ACM
15 years 3 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...