Sciweavers

298 search results - page 43 / 60
» Web Search Engines: Part 2
Sort
View
CSC
2008
14 years 11 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- 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...
Qi Yang, Jamie McPeek, Adam Nofsinger
WWW
2004
ACM
15 years 10 months ago
XQuery at your web service
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...
Jérôme Siméon, Nicola Onose
CORR
2006
Springer
93views Education» more  CORR 2006»
14 years 9 months ago
Constructing experimental indicators for Open Access documents
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...
Philipp Mayr
HT
2003
ACM
15 years 2 months ago
The connectivity sonar: detecting site functionality by structural patterns
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...
Einat Amitay, David Carmel, Adam Darlow, Ronny Lem...
ISSTA
2012
ACM
13 years 2 days ago
ViewPoints: differential string analysis for discovering client- and server-side input validation inconsistencies
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...
Muath Alkhalaf, Shauvik Roy Choudhary, Mattia Fazz...