Sciweavers

604 search results - page 79 / 121
» The Hardness of Metric Labeling
Sort
View
CIKM
2009
Springer
16 years 17 days ago
Collaborative filtering using random neighbours in peer-to-peer networks
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
Arno Bakker, Elth Ogston, Maarten van Steen
IVA
2009
Springer
16 years 16 days ago
Methodologies for the User Evaluation of the Motion of Virtual Humans
Abstract. Virtual humans are employed in many interactive applications, including (serious) games. Their motion should be natural and allow interaction with its surroundings and ot...
Sander E. M. Jansen, Herwin van Welbergen
KIVS
2009
Springer
16 years 16 days ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
HICSS
2008
IEEE
120views Biometrics» more  HICSS 2008»
16 years 13 days ago
Performance of a Wireless Unattended Sensor Network in a Freshwater Environment
This effort investigated the use of wireless unattended sensor network motes in the surroundings of a freshwater lake. The network was required to organize, establish and maintain...
John C. McEachen, Juan Casias
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
16 years 10 days ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...