3016 search results - page 331 / 604 » A Granular Approach to Web Search Result Presentation |
197
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
180
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
167
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In this paper, we propose a new user interface to interactively specify Web wrappers to extract relational information from Web documents. In this study, we focused on improving u...
161
Voted
CHI
2005
ACM
16 years 7 months ago
2005
ACM
This paper describes a novel approach to improve blind and visually impaired people's access to the Web by using a content-aware Web browser plug-in coupled with audio and ha...
199
click to vote
IEEESCC
2005
IEEE
16 years 10 days ago
2005
IEEE
Web service discovery is a key problem as the number of services is expected to increase dramatically. Service discovery at the present time is based primarily on keywords, or int...