5316 search results - page 1019 / 1064 » Which Search Problems Are Random |
130
click to vote
VL
1997
IEEE
15 years 5 months ago
1997
IEEE
Visual programming approaches are limited in their usefulness if they do not include a profile of their users that defines exactly who is attempting to solve what kind of problems...
146
Voted
SPAA
1997
ACM
15 years 5 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
108
Voted
DBVIS
1993
15 years 4 months ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
113
Voted
SWAT
2000
Springer
15 years 4 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
140
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...