Sciweavers

5326 search results - page 165 / 1066
» On what we can ensure
Sort
View
CNSR
2005
IEEE
100views Communications» more  CNSR 2005»
15 years 8 months ago
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
Thomas Reidemeister, Klemens Böhm, Paul A. S....
ECAI
2008
Springer
15 years 8 months ago
SLIDE: A Useful Special Case of the CARDPATH Constraint
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
WWW
2010
ACM
16 years 1 months ago
Collaborative location and activity recommendations with GPS history data
With the increasing popularity of location-based services, such as tour guide and location-based social network, we now have accumulated many location data on the Web. In this pap...
Vincent Wenchen Zheng, Yu Zheng, Xing Xie, Qiang Y...
COLING
2000
15 years 7 months ago
Word Sense Disambiguation of Adjectives Using Probabilistic Networks
In this paper, word sense dismnbiguation (WSD) accuracy achievable by a probabilistic classifier, using very milfimal training sets, is investigated. \Ve made the assuml)tiou that...
Gerald Chao, Michael G. Dyer
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 8 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik