BibSonomy publications for /author/ValentinTue Feb 14 00:00:00 CET 2012WCNCconf/wcnc/2007896-901Effect of User Mobility in Coded Cooperative Systems with Joint Partner and Cooperation Level Selection.2007dblp Mon Feb 13 00:00:00 CET 2012Intelligent Networking, Collaborative Systems and Applicationsseries/sci/2011-329235-255Studies in Computational IntelligenceIntrusion Detection in Multi-Agent Systems.3292011dblp Mon Feb 13 00:00:00 CET 2012Intelligent Networking, Collaborative Systems and Applicationsseries/sci/2011-329171-191Studies in Computational IntelligenceMonitoring and Performance Analysis of Workflow Applications in Large Scale Distributed Systems.3292011dblp Sun Feb 12 00:00:00 CET 2012ICSIPAconf/icsipa/2011121-126Pattern recognition for insect behavior by wrapper approach to subset selection of wavelet-multifractal attributes.2011dblp Sat Feb 11 19:24:16 CET 2012New York and NY and USAProceedings of the 16th international conference on World Wide Web211--220WWW '07The complex dynamics of collaborative tagging2007imported Sat Feb 11 19:24:16 CET 2012Berlin [u.a.]Practical Aspects of Knowledge Management62--73Lecture Notes in Computer ScienceSocial Semantic Bookmarking53452008Social Tagging;Semantic Web In this paper we present the novel paradigm of Social Semantic Bookmarking. Social Semantic Bookmarking combines the positive aspects of semantic annotation with those of social bookmarking and tagging while avoiding their respective drawbacks like the cumbersome maintenance of ontologies or the lacking semantic precision of tags. Social semantic bookmarking tools allow for the annotation of internet resources based on an ontology and the integrated maintenance of the ontology by the same people that use it. We introduce Social Semantic Bookmarking and present the SOBOLEO application as an implementation of this paradigm.Wed Feb 08 00:00:00 CET 2012CCCGconf/cccg/2011Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning.2011dblp Wed Feb 08 00:00:00 CET 2012GfKlconf/gfkl/2008271-281Studies in Classification, Data Analysis, and Knowledge OrganizationNonparametric Fine Tuning of Mixtures: Application to Non-Life Insurance Claims Distribution Estimation.2008dblp Wed Feb 08 00:00:00 CET 2012ITCconf/itc/2000882-891A comparison of classical scheduling approaches in power-constrained block-test scheduling.2000dblp Tue Feb 07 00:00:00 CET 2012IEEE Trans. Parallel Distrib. Syst.3452-459Balancing Performance and Cost in CMP Interconnection Networks.232012dblp Tue Feb 07 00:00:00 CET 2012IJCSA238-58Semantic Web Based Architecture for Managing Hardware Heterogeneity in Wireless Sensor Network.82011dblp Fri Feb 03 00:00:00 CET 2012Artificial Intelligence in Medicine2103-114Improved modeling of clinical data with kernel methods.542012dblp Thu Feb 02 00:00:00 CET 2012ADSOptimal Portfolios with End-of-Period Target.20122012dblp Thu Feb 02 00:00:00 CET 2012INCoSconf/incos/2011149-156Modelling Requirements for Enabling Meta-scheduling in Inter-Clouds and Inter-Enterprises.2011dblp Wed Feb 01 00:00:00 CET 2012IEEE Communications Letters2130-132Expected interference in wireless networks with geometric path loss: a closed-form approximation.142010dblp Wed Feb 01 00:00:00 CET 2012CoRRTableau-based decision procedure abs/1201.53462012dblp Tue Jan 31 21:08:40 CET 2012New York, NY, USAAAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems280--287{Modeling complex multi-issue negotiations using utility graphs}2005negotiation {This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic influence networks to derive efficient heuristics for negotiations about multiple issues. Experimental results show --- under relatively weak assumptions with respect to the structure of the utility functions - that the developed approach leads to Pareto-efficient outcomes. Moreover, Pareto-efficiency can be reached with few negotiation steps, because we explicitly model and utilize the underlying graphical structure of complex utility functions. Consequently, our approach is applicable to domains where reaching an efficient outcome in a limited amount of time is important. Furthermore, unlike other solutions for high-dimensional negotiations, the proposed approach does not require a mediator.}Fri Jan 27 00:00:00 CET 2012IEEE Transactions on Audio, Speech & Language Processing3922-932Audio Inpainting.202012dblp Wed Jan 25 00:00:00 CET 2012ISWCSconf/iswcs/2011121-125Extended non-binary Low-Density Parity-Check codes over erasure channels.2011dblp Wed Jan 25 00:00:00 CET 2012ISWCSconf/iswcs/201111-15Decoupling antenna height and tilt adaptation in large cellular networks.2011dblp