Sciweavers

73 search results - page 1 / 15
» Almost all webs are not rank-perfect
Sort
View
MP
2006
81views more  MP 2006»
13 years 4 months ago
Almost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
Arnaud Pêcher, Annegret Wagler
DATESO
2009
155views Database» more  DATESO 2009»
13 years 2 months ago
Tequila - a query language for the Semantic Web
In order to realize the idea of the Semantic Web, many tools and technologies need to be developed, including a query language. One of the most important technologies that creates ...
Jakub Galgonek
PG
2002
IEEE
13 years 9 months ago
Adaptive Solid Texturing for Web3D Applications
Solid texturing is a well-known computer graphics technology, but still has problems today, because it consumes too much time if every pixel is calculated on the fly or has a very...
Bing-Yu Chen, Tomoyuki Nishita
WWW
2008
ACM
14 years 5 months ago
Protecting web services from remote exploit code: a static analysis approach
We propose STILL, a signature-free remote exploit binary code injection attack blocker to protect web servers and web applications. STILL is robust to almost all anti-signature, a...
Xinran Wang, Yoon-chan Jhi, Sencun Zhu, Peng Liu
WISE
2006
Springer
13 years 10 months ago
Calculation of Target Locations for Web Resources
. A location-based search engine must be able to find and assign proper locations to Web resources. Host, content and metadata location information are not sufficient to describe t...
Saeid Asadi, Jiajie Xu, Yuan Shi, Joachim Diederic...