Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L4X0:0302 9743 "

Sökning: L4X0:0302 9743

Sortera/gruppera träfflistan
  • Angelsmark, Ola, 1972-, et al. (författare)
  • Algorithms for the Maximum Hamming Distance Problem
  • 2006
  • Ingår i: Recent Advances in Constraints : Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers. - Springer Berlin/Heidelberg. - 978-3-540-25176-7 - 978-3-540-32252-8 - 3-540-25176-6 ; s. 128-141
  • Bokkapitel (refereegranskat)abstract
    • <p>This book constitutes the thoroughly refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, held in Uppsala, Sweden in June 2005.</p><p>Besides papers taken from the workshop, others are submitted in response to an open call for papers after the workshop.</p><p>The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling.</p>
  • Dahllöf, Vilhelm (författare)
  • Algorithms for Max Hamming exact satisfiability
  • 2005
  • Ingår i: Algorithms and Computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005. Proceedings. - Springer Berlin/Heidelberg. - 978-3-540-30935-2 - 3-540-30935-7 ; s. 829-838
  • Bokkapitel (refereegranskat)abstract
    • <p>We here study MAX HAMMING XSAT, i.e., the problem of finding two XSAT models at maximum Hamming distance. By using a recent XSAT solver as an auxiliary function, an O(2(n)) time algorithm can be constructed, where n is the number of variables. This upper time bound can be further improved to O(1.8348(n)) by introducing a new kind of branching, more directly suited for finding models at maximum Hamming distance. The techniques presented here are likely to be of practical use as well as of theoretical value, proving that there are non-trivial algorithms for maximum Hamming distance problems.</p>
  • Lenz, Reiner (författare)
  • Lie-Theory and Dynamical Illumination Changes
  • 2000
  • Ingår i: Algebraic Frames for the Perception-Action Cycle : Second International Workshop, AFPAC 2000, Kiel, Germany, September 10-11, 2000. Proceedings. - Springer Berlin/Heidelberg. - 3-540-41013-9 - 978-3-540-41013-3 - 978-3-540-45260-7 ; s. 218-228
  • Bokkapitel (refereegranskat)abstract
    • <p>The description of the relation between the one-parameter groups of a group and the differential operators in the Lie-algebra of the group is one of the major topics in Lie-theory. In this paper we use this framework to derive a partial differential equation which describes the relation between the time-change of the spectral characteristics of the illumination source and the change of the color pixels in an image. In the first part of the paper we introduce and justify the usage of conical coordinate systems in color space. In the second part we derive the differential equation describing the illumination change and in the last part we illustrate the algorithm with some simulation examples.</p>
  • Nordh, Gustav (författare)
  • A trichotomy in the complexity of propositional circumscription
  • 2005
  • Ingår i: Logic for Programming, Artificial Intelligence, and Reasoning : 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005. Proceedings. - Springer Berlin/Heidelberg. - 3-540-25236-3 - 978-3-540-25236-8 - 978-3-540-32275-7 ; s. 257-269
  • Bokkapitel (refereegranskat)abstract
    • <p>Circumscription is one of the most important and well studied formalisms in the realm of nonmonotonic reasoning. The inference problem for propositional circumscription has been extensively studied from the viewpoint of computational complexity. We prove that there exists a trichotomy for the complexity of the inference problem in propositional variable circumscription. More specifically we prove that every restricted case of the problem is either &amp;UPi,(P)(2)-complete, coNP-complete, or in P.</p>
  • Peña, Jose M., 1974-, et al. (författare)
  • Scalable, efficient and correct learning of Markov boundaries under the faithfulness assumption
  • 2005
  • Ingår i: Symbolic and Quantitative Approaches to Reasoning with Uncertainty : 8th European Conference, ECSQARU 2005, Barcelona, Spain, July 6-8, 2005. Proceedings. - Springer Berlin/Heidelberg. - 3-540-27326-3 - 978-3-540-27326-4 - 978-3-540-31888-0 ; s. 136-147
  • Bokkapitel (refereegranskat)abstract
    • <p>We propose an algorithm for learning the Markov boundary of a random variable from data without having to learn a complete Bayesian network. The algorithm is correct under the faithfulness assumption, scalable and data efficient. The last two properties are important because we aim to apply the algorithm to identify the minimal set of random variables that is relevant for probabilistic classification in databases with many random variables but few instances. We report experiments with synthetic and real databases with 37, 441 and 139352 random variables showing that the algorithm performs satisfactorily.</p>
  • Pop, Paul (författare)
  • Embedded systems design : Optimization challenges
  • 2005
  • Ingår i: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31-June 1, 2005. Proceedings. - Springer Berlin/Heidelberg. - 978-3-540-26152-0 - 978-3-540-32264-1 - 3-540-26152-4 ; s. 16-16
  • Bokkapitel (refereegranskat)abstract
    • <p>Embedded systems are everywhere: from alarm clocks to PDAs, from mobile phones to cars, almost all the devices we use are controlled by embedded systems. Over 99% of the microprocessors produced today are used in embedded systems, and recently the number of embedded systems in use has become larger than the number of humans on the planet.</p>
  • Qvarfordt, Pernilla, et al. (författare)
  • RealTourist - A study of augmenting human-human and human-computer dialogue with eye-gaze overlay
  • 2005
  • Ingår i: Human-Computer Interaction - INTERACT 2005 : IFIP TC13 International Conference, Rome, Italy, September 12-16, 2005. Proceedings. - Springer Berlin/Heidelberg. - 978-3-540-28943-2 - 978-3-540-31722-7 - 3-540-28943-7 ; s. 767-780
  • Bokkapitel (refereegranskat)abstract
    • <p>We developed and studied an experimental system, RealTourist, which lets a user to plan a conference trip with the help of a remote tourist consultant who could view the tourist's eye-gaze superimposed onto a shared map. Data collected from the experiment were analyzed in conjunction with literature review on speech and eye-gaze patterns. This inspective, exploratory research identified various functions of gaze-overlay on shared spatial material including: accurate and direct display of partner's eye-gaze, implicit deictic referencing, interest detection, common focus and topic switching, increased redundancy and ambiguity reduction, and an increase of assurance, confidence, and understanding. This study serves two purposes. The first is to identify patterns that can serve as a basis for designing multimodal human-computer dialogue systems with eye-gaze locus as a contributing channel. The second is to investigate how computer-mediated communication can be supported by the display of the partner's eye-gaze.</p>
  • Tesanovic, Aleksandra, et al. (författare)
  • Ensuring real-time performance guarantees in dynamically reconfigurable embedded systems
  • 2005
  • Ingår i: Embedded and Ubiquitous Computing – EUC 2005 : International Conference EUC 2005, Nagasaki, Japan, December 6-9, 2005. Proceedings. - Springer Berlin/Heidelberg. - 978-3-540-30807-2 - 978-3-540-32295-5 - 3-540-30807-5 ; s. 131-141
  • Bokkapitel (refereegranskat)abstract
    • <p>In this paper we present a quality of service (QoS) adaptive framework for dynamic reconfiguration of component-based realtime systems. Our framework is light-weighted enabling reconfiguration in resource constrained embedded environments. Furthermore, it is possible to reconfigure both components and aspects of a system, hence, enabling finer timing of a real-time system. Real-time QoS guarantees are maintained in the system and under reconfiguration by employing feedback-based scheduling methods.</p>
  • Tesanovic, Aleksandra, et al. (författare)
  • Modular verification of reconfigurable components
  • 2005
  • Ingår i: Component-Based Software Development for Embedded Systems : An Overview of Current Research Trends. - Springer Berlin/Heidelberg. - 978-3-540-30644-3 - 978-3-540-31614-5 - 3-540-30644-7 ; s. 59-81
  • Bokkapitel (refereegranskat)abstract
    • <p>This chapter presents a framework for modular verification of reconfigurable real-time components. The framework enables proving that the reconfiguration of components via aspect weaving provides expected functional and temporal behavior in the reconfigured component. Within the framework we formally represent components and aspects as augmentations of timed automata. The verification is based on two algorithms: an algorithm that extracts necessary information into component verification interfaces, and an algorithm that checks, on an aspect, whether the property is preserved upon reconfiguration. Hence, the method ensures that components are verified only once for a particular property, while the property satisfaction under reconfiguration is checked only on aspects. Verification interfaces for a given property can be reused for multiple aspects and reconfigurations.</p>
  • Vitoria, Aida (författare)
  • A framework for reasoning with rough sets
  • 2005
  • Ingår i: Transactions on Rough Sets IV. - Springer Berlin/Heidelberg. - 978-3-540-29830-4 - 978-3-540-32016-6 - 3-540-29830-4 ; s. 178-276
  • Bokkapitel (refereegranskat)abstract
    • <p>Rough sets framework has two appealing aspects. First, it is a mathematical approach to deal with vague concepts. Second, rough set techniques can be used in data analysis to find patterns hidden in the data. The number of applications of rough sets to practical problems in different fields demonstrates the increasing interest in this framework and its applicability. This thesis(1) proposes a language that caters for implicit definitions of rough sets obtained by combining different regions of other rough sets. In this way, concept approximations can be derived by taking into account domain knowledge. A declarative semantics for the language is also discussed. It is then shown that programs in the proposed language can be compiled to extended logic programs under the paraconsistent stable model semantics. The equivalence between the declarative semantics of the language and the declarative semantics of the compiled programs is proved. This transformation provides the computational basis for implementing our ideas. A query language for retrieving information about the concepts represented through the defined rough sets is also discussed. Several motivating applications are described. Finally, an extension of the proposed language with numerical measures is presented. This extension is motivated by the fact that numerical measures are an important aspect in data mining applications.</p>
Skapa referenser, mejla, bekava och länka
fritt online (367)
Typ av publikation
konferensbidrag (2469)
bokkapitel (393)
proceedings (redaktörskap) (82)
samlingsverk (redaktörskap) (20)
bok (7)
Typ av innehåll
övrigt vetenskapligt (2949)
refereegranskat (2784)
populärvet., debatt m.m. (8)
Zaslavsky, Arkady (52)
Fritzson, Peter, (33)
Boström, Henrik, (30)
Abdulla, Parosh Aziz ... (26)
Lambrix, Patrick, (25)
Wikström, Douglas, (25)
visa fler...
Felsberg, Michael, (24)
Johansson, Ulf, (23)
Jonsson, Bengt, (22)
Johannesson, Paul, (21)
Ziemke, Tom, (21)
Vinel, Alexey, 1983- ... (20)
Flammini, Francesco, ... (20)
Pettersson, Paul, (20)
Lindblad, Joakim, (20)
Weyns, Danny, (19)
Taha, Walid, 1971-, (19)
Beskow, Jonas, (18)
Bhatt, Mehul, Profes ... (18)
Felsberg, Michael, 1 ... (18)
Szalas, Andrzej, (17)
Rezine, Ahmed, (16)
Linusson, Henrik, (16)
Gallina, Barbara, (16)
Osipov, Evgeny, (15)
Torra, Vicenç, (15)
Crnkovic, Ivica, (15)
Jonsson, Peter, (15)
Loke, Seng Wai (15)
Gurov, Dilian, (15)
Gulz, Agneta, (15)
Sirjani, Marjan, (15)
Mazzocca, Nicola, (14)
Atig, Mohamed Faouzi ... (14)
Mousavi, Mohammad Re ... (14)
Bigun, Josef, (14)
Drewes, Frank, (14)
Knutsson, Hans (14)
Sladoje, Nataša, (14)
Volkamer, Melanie, (14)
Jonsson, Magnus, 196 ... (13)
Löfström, Tuve, (13)
Dam, Mads, (13)
Nadjm-Tehrani, Simin ... (13)
Lenz, Reiner, (13)
Haake, Magnus, (13)
Doherty, Patrick, 19 ... (13)
Hansen, Preben, (13)
Chen, Jingsen (13)
Vittorini, Valeria, (13)
visa färre...
Kungliga Tekniska Högskolan (691)
Linköpings universitet (548)
Uppsala universitet (244)
Mälardalens högskola (208)
Luleå tekniska universitet (190)
Umeå universitet (144)
visa fler...
Högskolan i Halmstad (141)
Högskolan i Skövde (134)
Linnéuniversitetet (134)
Stockholms universitet (117)
Örebro universitet (97)
Karlstads universitet (76)
Högskolan i Jönköping (51)
swepub_uni:mau_t (47)
Blekinge Tekniska Högskola (34)
Högskolan Dalarna (20)
RISE (18)
Mittuniversitetet (16)
Södertörns högskola (14)
Högskolan Väst (10)
Högskolan i Borås (10)
Lunds universitet (9)
Högskolan i Gävle (7)
Röda Korsets Högskola (4)
Försvarshögskolan (3)
VTI - Statens väg- och transportforskningsinstitut (2)
Högskolan Kristianstad (1)
Konstfack (1)
visa färre...
Engelska (2966)
Svenska (5)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (1877)
Teknik (902)
Samhällsvetenskap (162)
Medicin och hälsovetenskap (50)
Humaniora (24)
Lantbruksvetenskap (1)


pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy