作者: Sciatica 時間: 2025-3-21 23:58
used for decades in approximating query result sizes in the query optimizer, and methods such as the Equi-Width and Equi-Depth histograms have been incorporated in all real-life systems. This is because histograms are simple structures, and can be easily utilized in determining efficient Query Evalu作者: exhilaration 時間: 2025-3-22 02:09
Bruno Martinaphos (Cyprus), organized by the Institute for Systems and Technologies of Information, Control and Communication (INSTICC) in collaboration with the University of Cyprus, Aristotle University of Thessaloniki and Athens University of Economics and Business. ICEIS has become a major point of contact 作者: hardheaded 時間: 2025-3-22 08:33 作者: 類人猿 時間: 2025-3-22 11:51 作者: Compass 時間: 2025-3-22 16:31 作者: craven 時間: 2025-3-22 17:17 作者: Foreknowledge 時間: 2025-3-23 00:58 作者: Odyssey 時間: 2025-3-23 05:00 作者: 閑蕩 時間: 2025-3-23 08:26
Thomas Brihaye,Aline Goeminnele industry. Objectives are the identification of the supply-chain, order management, tracking and problem reporting (such as dangerous substance detection). It is intended to be a generic platform supporting potentially any kind of industrial supply-chain, to be usable in harsh environments (mobile作者: 斜谷 時間: 2025-3-23 12:28 作者: accomplishment 時間: 2025-3-23 17:54 作者: 皺痕 時間: 2025-3-23 20:53
Alain Finkel,Serge Haddad,Lina Yele industry. Objectives are the identification of the supply-chain, order management, tracking and problem reporting (such as dangerous substance detection). It is intended to be a generic platform supporting potentially any kind of industrial supply-chain, to be usable in harsh environments (mobile作者: Individual 時間: 2025-3-24 02:03
Stijn Bellis,Joachim Denil,Ramesh Krishnamurthy,Tim Leys,Guillermo A. Pérez,Ritam Rahale industry. Objectives are the identification of the supply-chain, order management, tracking and problem reporting (such as dangerous substance detection). It is intended to be a generic platform supporting potentially any kind of industrial supply-chain, to be usable in harsh environments (mobile作者: 物種起源 時間: 2025-3-24 03:47 作者: Aggregate 時間: 2025-3-24 09:56
Angelo Ferrando,Giorgio Delzanno items may not be directly identified using only metrics collected from the source code. CVM-TD is a model to support the identification of technical debt by considering the developer point of view when identifying TD through code comment analysis. In this paper, we investigate the use of CVM-TD wit作者: 樸素 時間: 2025-3-24 11:31
David Auger,Pierre Coucheney,Loric Duhazé,Kossi Roland Etse with such kind of data is that the gathered reports quickly become too similar among themselves. Hence, too much similar reports, namely near-duplicates, do not add valuable knowledge to assist crisis control committees in their decision making tasks. The current approaches to detect near-duplicate作者: 職業(yè)拳擊手 時間: 2025-3-24 17:33 作者: lymphoma 時間: 2025-3-24 21:26 作者: Thrombolysis 時間: 2025-3-25 00:06 作者: 跟隨 時間: 2025-3-25 03:42 作者: FRONT 時間: 2025-3-25 07:58 作者: 低三下四之人 時間: 2025-3-25 11:50
s between phases via a data-driven method. This paper extends the previous approach in both breadth and depth and focuses especially on making its benefits, like the demonstrated 39% savings in bandwidth, to domain experts. We propose a novel, user-friendly assistant that enables domain experts to d作者: essential-fats 時間: 2025-3-25 18:44 作者: Generator 時間: 2025-3-25 21:19
Cinzia Di Giusto,Davide Ferre’,Etienne Lozes,Nicolas Nissesults obtained in past observations, it is possible to determine the percentage of precision that each parameter obtained, and, in this way, to determine the parameters that are more likely to obtain more accurate values in future observations, thus, eliminating the need to use specific algorithms t作者: STERN 時間: 2025-3-26 01:46
Paul C. Bell,Reino Niskanen,Igor Potapov,Pavel Semukhintaneously, the indirect characteristics are extracted through the alignment of audio signals, the Hidden Markov Model, and some heuristics of improvement. The indication of the probability of dyslexia is performed using a machine learning algorithm. The tests were compared with the specialist’s clas作者: ARCHE 時間: 2025-3-26 06:20 作者: 混合,攙雜 時間: 2025-3-26 10:46
Eike Neumanne design and implementation choices, and (iii) the test results. The main value of this paper is the usage of the Semantic Web in real-world industrial traceability solutions, which were tested in real supply-chains in Switzerland and India. The commercialization of the developed solutions has start作者: Between 時間: 2025-3-26 14:06 作者: 口味 時間: 2025-3-26 17:17 作者: Indict 時間: 2025-3-27 00:40
Stijn Bellis,Joachim Denil,Ramesh Krishnamurthy,Tim Leys,Guillermo A. Pérez,Ritam Rahae design and implementation choices, and (iii) the test results. The main value of this paper is the usage of the Semantic Web in real-world industrial traceability solutions, which were tested in real supply-chains in Switzerland and India. The commercialization of the developed solutions has start作者: SOBER 時間: 2025-3-27 02:21
Pamela Fleischmann,Sungmin Kim,Tore Ko?,Florin Manea,Dirk Nowotka,Stefan Siemer,Max Wiedenh?ftof technical debt by participants. The results indicated that CVM-TD provided promising results considering the accuracy values. English reading skills have an impact on the TD detection process. We could not conclude that the experience level affects this process. We identified a list of the 20 mos作者: 水獺 時間: 2025-3-27 08:07
Angelo Ferrando,Giorgio Delzannoof technical debt by participants. The results indicated that CVM-TD provided promising results considering the accuracy values. English reading skills have an impact on the TD detection process. We could not conclude that the experience level affects this process. We identified a list of the 20 mos作者: FUME 時間: 2025-3-27 12:38 作者: 冒失 時間: 2025-3-27 15:48
ider. Therefore, data confidentiality is an important concern from cloud service providers. Recently, three main approaches have been introduced to ensure data confidentiality in cloud services: data encryption; combination of encryption and fragmentation; and fragmentation. Besides, other strategie作者: Ringworm 時間: 2025-3-27 18:40
Bruno Martin, thus making a bridge between Academia and Enterprise. Following the success of 2005, ICEIS 2006 received 404 paper submissions from more than 40 countries spa978-3-540-77580-5978-3-540-77581-2Series ISSN 1865-1348 Series E-ISSN 1865-1356 作者: 有權(quán)威 時間: 2025-3-27 22:29
Honglu Sun,Maxime Folschette,Morgan Magnind Internet Computing” and “Human–Computer Interaction”. All tracks describe research work that is often oriented toward real-world applications and hi- light th978-3-642-01346-1978-3-642-01347-8Series ISSN 1865-1348 Series E-ISSN 1865-1356 作者: consolidate 時間: 2025-3-28 02:27 作者: 教育學(xué) 時間: 2025-3-28 07:09 作者: garrulous 時間: 2025-3-28 13:54
On the?Identity and?Group Problems for?Complex Heisenberg Matricesr the problem making a step forward towards more general problems such as the Membership Problem. We extend our techniques to show that the fundamental problem of determining if a given set of Heisenberg matrices generates a group, can also be decided in polynomial time.作者: 打折 時間: 2025-3-28 18:27
Multi-weighted Reachability Gamese obtained thanks to a fixpoint algorithm which also computes the upper value in polynomial time and the Pareto frontier in exponential time. Finally, the constrained existence problem is proved in . for the lexicographic order and .-complete for the componentwise order.作者: 證明無罪 時間: 2025-3-28 22:29 作者: 下級 時間: 2025-3-29 02:06 作者: 填滿 時間: 2025-3-29 06:48 作者: PLAYS 時間: 2025-3-29 07:35
Quantitative Reachability Stackelberg-Pareto Synthesis Is ,-Completently investigated for .-regular objectives. We solve this problem for weighted graph games and quantitative reachability objectives such that Player?0 wants to reach his target set with a total cost less than some given upper bound. We show that it is .-complete, as for Boolean reachability objectives.作者: fatuity 時間: 2025-3-29 14:12
On the?Complexity of?Robust Eventual Inequality Testing for?C-Finite Functionsomputational complexity, we develop a natural notion of polynomial-time decidability of subsets of computable metric spaces which extends our recently introduced notion of maximal partial decidability. We show that eventual inequality of C-finite functions is polynomial-time decidable in this sense.作者: Infant 時間: 2025-3-29 17:52 作者: 堅(jiān)毅 時間: 2025-3-29 22:19 作者: BARB 時間: 2025-3-30 02:30
