標(biāo)題: Titlebook: Algorithms and Data Structures; 7th International Wo Frank Dehne,J?rg-Rüdiger Sack,Roberto Tamassia Conference proceedings 2001 Springer-Ve [打印本頁(yè)] 作者: ACE313 時(shí)間: 2025-3-21 19:00
書(shū)目名稱Algorithms and Data Structures影響因子(影響力)
書(shū)目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名
書(shū)目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Algorithms and Data Structures被引頻次
書(shū)目名稱Algorithms and Data Structures被引頻次學(xué)科排名
書(shū)目名稱Algorithms and Data Structures年度引用
書(shū)目名稱Algorithms and Data Structures年度引用學(xué)科排名
書(shū)目名稱Algorithms and Data Structures讀者反饋
書(shū)目名稱Algorithms and Data Structures讀者反饋學(xué)科排名
作者: PLIC 時(shí)間: 2025-3-21 23:27 作者: 內(nèi)行 時(shí)間: 2025-3-22 03:44 作者: 凝結(jié)劑 時(shí)間: 2025-3-22 06:37
Competitive Analysis of the LRFU Paging Algorithmin and El-Yaniv. Although LRFU, as it turns out, is not optimally competitive, it is expected to behave well in practice, especially in web applications, as it combines the benefits of both LRU and LFU.作者: 壁畫(huà) 時(shí)間: 2025-3-22 11:32
Vom Physikalischen zum Physikalismusirs of input points. We apply these results to vertex separation and symmetry display in spherical graph drawing, viewpoint selection in hyperbolic browsing, element size control in conformal structured mesh generation, and brain flat mapping.作者: Indebted 時(shí)間: 2025-3-22 15:45
Der Eliminativismus als stiller Begleitery on the size of the data set and on the number of points in the answer but also on the difference between .. and the current time; queries close to the current time are answered fast, while queries that are far away in the future or in the past may take more time.作者: 激怒某人 時(shí)間: 2025-3-22 19:36
Pl?doyer für grüne Dorfrepubliken in Indienoved randomized algorithm with expected running time .((. log . + .)α(.)log.) (which is faster for small values of .). For . = 3, we present an .(.. + .)-time algorithm, for any ε>0. Our algorithms can be modified to count the number of intersecting pairs in .(.. log..) time for the planar case, and in .(..) time and ?..作者: 格子架 時(shí)間: 2025-3-22 23:47 作者: 現(xiàn)暈光 時(shí)間: 2025-3-23 04:10 作者: Bernstein-test 時(shí)間: 2025-3-23 09:36
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensionsoved randomized algorithm with expected running time .((. log . + .)α(.)log.) (which is faster for small values of .). For . = 3, we present an .(.. + .)-time algorithm, for any ε>0. Our algorithms can be modified to count the number of intersecting pairs in .(.. log..) time for the planar case, and in .(..) time and ?..作者: intercede 時(shí)間: 2025-3-23 12:26 作者: 凌辱 時(shí)間: 2025-3-23 16:25 作者: Blood-Clot 時(shí)間: 2025-3-23 21:22 作者: 摘要記錄 時(shí)間: 2025-3-23 22:15 作者: 投射 時(shí)間: 2025-3-24 05:19 作者: 為寵愛(ài) 時(shí)間: 2025-3-24 08:32
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programmingring integer programs. We describe applications of these techniques and results to a generalization of Dominating Set motivated by distributed file sharing applications, to an optimization problem motivated by an analysis of boosting, and to a generalization of matching in hypergraphs.作者: 自愛(ài) 時(shí)間: 2025-3-24 10:54
Seller-Focused Algorithms for Online Auctioningrministic strategies. Additionally we present experimental evidence to show that our algorithm outperforms conventional heuristic methods in practice. And finally we explore ways of modifying the conventional model of online algorithms to improve competitiveness of other types of auctioning scenarios while still maintaining fairness.作者: Offbeat 時(shí)間: 2025-3-24 15:37 作者: Congruous 時(shí)間: 2025-3-24 22:38 作者: Magisterial 時(shí)間: 2025-3-25 01:28
Der Plan als Befehl und Fiktiony triangulation of the set of disks as the underlying structure, we discuss how to maintain, as the disks move, (1) the closest pair, (2) the connectivity of the set of disks and (3) in the case of non-intersecting disks, the near neighbors of a disk.作者: gimmick 時(shí)間: 2025-3-25 07:01 作者: gait-cycle 時(shí)間: 2025-3-25 08:35 作者: 濕潤(rùn) 時(shí)間: 2025-3-25 12:30
Frank Dehne,J?rg-Rüdiger Sack,Roberto TamassiaIncludes supplementary material: 作者: 褲子 時(shí)間: 2025-3-25 17:50 作者: 征服 時(shí)間: 2025-3-25 21:15
Die DDR war eine HauswirtschaftWe show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width . for some fixed integer ..作者: 易怒 時(shí)間: 2025-3-26 00:25 作者: 惡意 時(shí)間: 2025-3-26 04:34
Wolfgang Schaper,Martin G. GottwikWe present a randomized approximation algorithm for the metric undirected .. Its expected performance guarantee approaches 7/8 as . → ∞, where . is the number of vertices in the graph.作者: obligation 時(shí)間: 2025-3-26 09:18
Deciding Clique-Width for Graphs of Bounded Tree-WidthWe show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width . for some fixed integer ..作者: integral 時(shí)間: 2025-3-26 16:29
Optimization over Zonotopes and Training Support Vector MachinesWe make a connection between classical polytopes called zonotopes and Support Vector Machine (SVM) classifiers. We combine this connection with the ellipsoid method to give some new theoretical results on training SVMs. We also describe some special properties of C-SVMs for . → ∞.作者: saphenous-vein 時(shí)間: 2025-3-26 19:41 作者: arthrodesis 時(shí)間: 2025-3-27 00:38 作者: 偏狂癥 時(shí)間: 2025-3-27 01:13 作者: entrance 時(shí)間: 2025-3-27 05:17 作者: COLIC 時(shí)間: 2025-3-27 12:10 作者: daredevil 時(shí)間: 2025-3-27 17:41 作者: 鴿子 時(shí)間: 2025-3-27 18:09 作者: BLUSH 時(shí)間: 2025-3-27 22:38
Der Eliminativismus als stiller Begleiteren time .. can be answered efficiently. The novel feature of our data structures is that the number of I/Os required to answer a query depends not only on the size of the data set and on the number of points in the answer but also on the difference between .. and the current time; queries close to t作者: LAY 時(shí)間: 2025-3-28 04:27
Der Plan als Befehl und Fiktion The most important aspect in our approach is that we can maintain the Voronoi diagram even in the case of intersecting disks. We achieve that by augmenting the Delaunay triangulation with some edges associated with the disks that do not contribute to the Voronoi diagram. Using the augmented Delauna作者: 要求比…更好 時(shí)間: 2025-3-28 07:38 作者: frugal 時(shí)間: 2025-3-28 13:21 作者: maladorit 時(shí)間: 2025-3-28 18:24
Pl?doyer für grüne Dorfrepubliken in Indienall . pairs of indices (.) such that .. intersects ... For the planar case we describe a simple algorithm with running time .(..log. + .), and an improved randomized algorithm with expected running time .((. log . + .)α(.)log.) (which is faster for small values of .). For . = 3, we present an .(.. +作者: 指令 時(shí)間: 2025-3-28 19:24 作者: 繁忙 時(shí)間: 2025-3-29 01:51
Die Konfliktlandschaft der Umweltdiplomatieithms. We show that the competitive ratio of LRFU is ., where . 1 is the decay parameter used by the LRFU algorithm, and . is the size of the cache. This supplies, in particular, the first natural paging algorithms that are competitive but are not optimally competitive, answering a question of Borod作者: 誘騙 時(shí)間: 2025-3-29 03:28 作者: APO 時(shí)間: 2025-3-29 10:39 作者: 搜尋 時(shí)間: 2025-3-29 12:51 作者: relieve 時(shí)間: 2025-3-29 16:04
,Pr?vention des pl?tzlichen Herztodes, smallest number of reflex vertices in a simple polygonalization of .. We prove various combinatorial bounds and provide efficient algorithms to compute reflexivity, both exactly (in special cases) and approximately (in general). Our study naturally takes us into the examination of some closely rela作者: Spina-Bifida 時(shí)間: 2025-3-29 23:45 作者: languid 時(shí)間: 2025-3-30 00:34 作者: Kernel 時(shí)間: 2025-3-30 04:43 作者: Obsessed 時(shí)間: 2025-3-30 08:29 作者: NEX 時(shí)間: 2025-3-30 15:21 作者: 割讓 時(shí)間: 2025-3-30 17:10 作者: 先兆 時(shí)間: 2025-3-31 00:35 作者: 藥物 時(shí)間: 2025-3-31 04:41 作者: 尊敬 時(shí)間: 2025-3-31 09:05 作者: 催眠藥 時(shí)間: 2025-3-31 11:01
On the Complexity of Scheduling Conditional Real-Time Codeof such codes when triggered by external events require to be executed within a given deadline from the triggering time. The feasibility analysis problem for such a real-time system asks whether it is possible to schedule all such blocks of code so that all the associated deadlines are met even in t作者: 正式通知 時(shí)間: 2025-3-31 13:28
Time Responsive External Data Structures for Moving Pointsen time .. can be answered efficiently. The novel feature of our data structures is that the number of I/Os required to answer a query depends not only on the size of the data set and on the number of points in the answer but also on the difference between .. and the current time; queries close to t作者: 相容 時(shí)間: 2025-3-31 20:54 作者: Parley 時(shí)間: 2025-3-31 22:22 作者: Admire 時(shí)間: 2025-4-1 04:25
Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensionsrticular, we prove a tight upper bound of .(..) for the vertical decomposition of an arrangement of . hyperplanes in four dimensions, improving the best previously known bound [.] by a logarithmic factor. We also show that the complexity of the vertical decomposition of an arrangement of . 3-simplic作者: CORE 時(shí)間: 2025-4-1 07:02
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensionsall . pairs of indices (.) such that .. intersects ... For the planar case we describe a simple algorithm with running time .(..log. + .), and an improved randomized algorithm with expected running time .((. log . + .)α(.)log.) (which is faster for small values of .). For . = 3, we present an .(.. +作者: AVID 時(shí)間: 2025-4-1 12:35 作者: IVORY 時(shí)間: 2025-4-1 18:22 作者: Inferior 時(shí)間: 2025-4-1 22:23
Admission Control to Minimize Rejectionsls that arrive over time, accepting some and rejecting others in order to stay within capacity limitations of the network. In the standard theoretical formulation, this problem is analyzed as a benefit problem: the goal is to devise an online algorithm that accepts at least a reasonable fraction of
