Sciweavers

4378 search results - page 638 / 876
» On the Complexity of Ordered Colourings
Sort
View
PLANX
2007
15 years 8 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
SECRYPT
2007
121views Business» more  SECRYPT 2007»
15 years 8 months ago
Using Steganography to Improve Hash Functions' Collision Resistance
Lately, hash function security has received increased attention. Especially after the recent attacks that were presented for SHA-1 and MD5, the need for a new and more robust hash...
Emmanouel Kellinis, Konstantinos Papapanagiotou
WICON
2008
15 years 8 months ago
Constructing accurate, space-efficient, wireless coverage maps for vehicular contexts
Wireless connectivity for vehicles is a fast-growing market, with a plethora of different network technologies already in use. Surveys of the numbers of IEEE 802.11b/g access poin...
David N. Cottingham, Robert K. Harle, Andy Hopper
WONTO
2008
15 years 8 months ago
Personalized Reliable Web service Compositions
Nowadays Internet is anywhere and users can find all possible information. In this situation, the new challenge is to provide the right information at the right time. As Web servic...
Daniela Barreiro Claro, Oriana Licchelli, Patrick ...
AAAI
2004
15 years 8 months ago
Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
Alexandre Albore, Piergiorgio Bertoli