298 search results - page 43 / 60 » Web Search Engines: Part 2 |
CSC
2008
15 years 17 days 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...
76
Voted
WWW
2004
ACM
15 years 11 months ago
2004
ACM
XML messaging is at the heart of Web services, providing the flexibility required for their deployment, composition, and maintenance. Yet, current approaches to Web services devel...
73
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
The ongoing paradigm change in the scholarly publication system (`science is turning to e-science') makes it necessary to construct alternative evaluation criteria/metrics wh...
102
click to vote
HT
2003
ACM
15 years 4 months ago
2003
ACM
Web sites today serve many different functions, such as corporate sites, search engines, e-stores, and so forth. As sites are created for different purposes, their structure and...
114
Voted
ISSTA
2012
ACM
13 years 1 months ago
2012
ACM
Since web applications are easily accessible, and often store a large amount of sensitive user information, they are a common target for attackers. In particular, attacks that foc...