標題: Titlebook: Algorithms –- ESA 2012; 20th Annual European Leah Epstein,Paolo Ferragina Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 201 [打印本頁] 作者: 自治 時間: 2025-3-21 19:59
書目名稱Algorithms –- ESA 2012影響因子(影響力)
書目名稱Algorithms –- ESA 2012影響因子(影響力)學科排名
書目名稱Algorithms –- ESA 2012網(wǎng)絡(luò)公開度
書目名稱Algorithms –- ESA 2012網(wǎng)絡(luò)公開度學科排名
書目名稱Algorithms –- ESA 2012被引頻次
書目名稱Algorithms –- ESA 2012被引頻次學科排名
書目名稱Algorithms –- ESA 2012年度引用
書目名稱Algorithms –- ESA 2012年度引用學科排名
書目名稱Algorithms –- ESA 2012讀者反饋
書目名稱Algorithms –- ESA 2012讀者反饋學科排名
作者: covert 時間: 2025-3-21 20:42 作者: Boycott 時間: 2025-3-22 00:27 作者: choroid 時間: 2025-3-22 08:01
https://doi.org/10.1007/978-3-531-91510-4of cost no more than 9 OPT using a buffer of capacity 4.?+?1 where OPT is the cost of an optimal solution with buffer capacity .. Via randomized tree embeddings, this implies an .(log.) approximation to cost and .(1) approximation to buffer size for general metrics. In contrast, when the buffer cons作者: 花爭吵 時間: 2025-3-22 12:26 作者: Mutter 時間: 2025-3-22 16:55
Lower Bounds for Sorted Geometric Queries in the I/O Model,is is highly relevant in an I/O context because storing a massive data set in a superlinear-space data structure is often infeasible. We also prove that answering queries using . I/Os requires . space, where . is the input size, . is the block size, and . is the size of the main memory. This bound i作者: vector 時間: 2025-3-22 19:20 作者: outer-ear 時間: 2025-3-23 00:30 作者: CRANK 時間: 2025-3-23 04:43 作者: LUT 時間: 2025-3-23 07:57
,über das panamerikanische Abkommen,atamining applications; from search engines to recommendation systems; advancing the state of the art of voice recognition, translation and more. The design, analysis and engineering of Big Data algorithms has multiple flavors, including massive parallelism, streaming algorithms, sketches and synops作者: AROMA 時間: 2025-3-23 10:21
,Bekannte intrazellul?re Transportprozesse,.e., the makespan. It is known that if the mechanism is non-preemptive, the price of anarchy is Ω(log.). Both Azar, Jain, and Mirrokni (SODA 2008) and Caragiannis (SODA 2009) raised the question whether it is possible to design a coordination mechanism that has constant price of anarchy using preemp作者: NUDGE 時間: 2025-3-23 15:42 作者: miniature 時間: 2025-3-23 19:53
https://doi.org/10.1007/978-3-658-37486-0h attention so far. Two of the most prominent problems in this class are angular sorting queries and sorted .-nearest neighbour queries. The former asks us to preprocess an input point set . in the plane so that, given a query point ., the clockwise ordering of the points in . around . can be comput作者: critique 時間: 2025-3-24 02:01
https://doi.org/10.1007/978-3-658-37486-0t network that represents all trajectories in the set. We present a simple and practical incremental algorithm that is based on partial matching of the trajectories to the graph. We use minimumlink paths to reduce the complexity of the reconstructed graph. We provide quality guarantees and experimen作者: Acclaim 時間: 2025-3-24 05:03
https://doi.org/10.1007/978-3-658-37486-0ently approximated (and frequently even exactly determined) using heuristics that apply a limited number of BFS traversals. If the input graphs have to be kept and processed on external storage, even a single BFS run may cause an unacceptable amount of time-consuming I/O-operations..Meyer [17] propo作者: 偽造 時間: 2025-3-24 10:24 作者: embolus 時間: 2025-3-24 14:08
https://doi.org/10.1007/978-3-322-81023-6used, maintaining the favorable performance guarantees: with stash size . the probability of a rehash is .(1/..), and the evaluation time is .(.). Instead of the full randomness needed for the analysis of Kirsch . and of Kutzelnigg (2010) (resp. Θ(log.)-wise independence for standard cuckoo hashing)作者: Monocle 時間: 2025-3-24 16:15
Khadija Katja W?hler-Khalfallahrriving key a label from the label set {1,2,…,.} so that the order of labels (strictly) respects the ordering on .. As new keys arrive it may be necessary to change the labels of some items; such changes may be done at any time at unit cost for each change. The goal is to minimize the total cost. An作者: Cumbersome 時間: 2025-3-24 21:44 作者: tendinitis 時間: 2025-3-25 02:02
,Islam in ?sterreich und Deutschland,ty of at most .(.,.)?=?..(.) ... Up to constant factors, this matches a recent result of K?nemann et al.?for the set cover case, i.e.?when all the covering requirements are 1. One consequence of this is an .(1)-approximation for geometric weighted set multi-cover problems when the geometric objects 作者: Extricate 時間: 2025-3-25 06:44
https://doi.org/10.1007/978-3-531-91510-4ust move to the corresponding point in the metric. The requests can be processed slightly out of order; in particular, the server has a buffer of capacity . which can store up to . requests as it reads in the sequence. The goal is to reorder the requests in such a manner that the buffer constraint i作者: 未成熟 時間: 2025-3-25 08:01
https://doi.org/10.1007/978-3-531-92450-2 be an approximation of energy consumption, distance, tolls, or other penalties. The resulting problem is NP-hard, but if the additional cost is proportional to driving distance we can solve it optimally on the German road network within 2.3 s using a multi-label A* search. A generalization of time-作者: concubine 時間: 2025-3-25 13:33
Politik und Gesellschaft des Nahen Ostensunds, and the few lower bounds, known for such representations, and how they interact with the space used. In this article we prove a strong lower bound for ., which holds for rather permissive assumptions on the space used, and give matching upper bounds that require only a compressed representatio作者: GRUEL 時間: 2025-3-25 18:32
Toyota — Managementsystem des Wandels.-vertex graph to decide if vertices?. and?. are connected, under the promise that they either are connected by a path of length at most?., or are disconnected. We also give .(.)-query algorithms that decide if a graph contains as a subgraph a path, a star with two subdivided legs, or a subdivided c作者: Accolade 時間: 2025-3-25 22:06
https://doi.org/10.1007/978-3-8350-9562-5 .,. of such triangulations, we construct a path whose length is no more than . times the Euclidean distance between . and ., and this bound is the best possible. This definitively improves the 25-year old bound of . by Chew (SoCG?’86). This is the first time the stretch factor of the ..-Delaunay tr作者: 刺耳 時間: 2025-3-26 00:56 作者: 一瞥 時間: 2025-3-26 08:11 作者: Injunction 時間: 2025-3-26 09:51 作者: Arteriography 時間: 2025-3-26 13:42
Khadija Katja W?hler-KhalfallahWe present a simple, efficient and practical algorithm for constructing and subsequently simplifying contour maps from massive high-resolution DEMs, under some practically realistic assumptions on the DEM and contours.作者: 符合國情 時間: 2025-3-26 16:51
Open Problems in Throughput Scheduling,In this talk we survey the area of scheduling with the objective to maximize the throughput, i.e., the (weighted) number of completed jobs. We focus on several open problems.作者: neolith 時間: 2025-3-26 22:55 作者: crutch 時間: 2025-3-27 03:05
Simplifying Massive Contour Maps,We present a simple, efficient and practical algorithm for constructing and subsequently simplifying contour maps from massive high-resolution DEMs, under some practically realistic assumptions on the DEM and contours.作者: 芭蕾舞女演員 時間: 2025-3-27 09:19 作者: Spina-Bifida 時間: 2025-3-27 12:10
978-3-642-33089-6Springer-Verlag Berlin Heidelberg 2012作者: sigmoid-colon 時間: 2025-3-27 16:54 作者: 大暴雨 時間: 2025-3-27 21:40 作者: GOAD 時間: 2025-3-28 01:32 作者: 不能妥協(xié) 時間: 2025-3-28 02:21
Khadija Katja W?hler-Khalfallahlgorithm proposed by Zhang . [7] and improves the approximation ratio from 5.83 to 5. We achieve this by modifying the ., . and . operations. The idea of taking linear combinations of inequalities used in Aggarwal .[1] is crucial in achieving this result. The example proposed by Zhang . also shows that our analysis is tight.作者: immunity 時間: 2025-3-28 08:04
On Big Data Algorithmics,atamining applications; from search engines to recommendation systems; advancing the state of the art of voice recognition, translation and more. The design, analysis and engineering of Big Data algorithms has multiple flavors, including massive parallelism, streaming algorithms, sketches and synops作者: 得體 時間: 2025-3-28 10:32 作者: exacerbate 時間: 2025-3-28 18:16
Bottleneck Non-crossing Matching in the Plane,dy the problem of computing ... We present an .(..log..)-time algorithm that computes a non-crossing matching . of ., such that ., where .(.) is the length of a longest edge in .. An interesting implication of our construction is that .. We also show that when the points of . are in convex position,作者: Galactogogue 時間: 2025-3-28 21:25
Lower Bounds for Sorted Geometric Queries in the I/O Model,h attention so far. Two of the most prominent problems in this class are angular sorting queries and sorted .-nearest neighbour queries. The former asks us to preprocess an input point set . in the plane so that, given a query point ., the clockwise ordering of the points in . around . can be comput作者: GROWL 時間: 2025-3-29 00:23 作者: Definitive 時間: 2025-3-29 04:27
I/O-efficient Hierarchical Diameter Approximation,ently approximated (and frequently even exactly determined) using heuristics that apply a limited number of BFS traversals. If the input graphs have to be kept and processed on external storage, even a single BFS run may cause an unacceptable amount of time-consuming I/O-operations..Meyer [17] propo作者: 亞當心理陰影 時間: 2025-3-29 08:41 作者: nonplus 時間: 2025-3-29 13:47 作者: 膠水 時間: 2025-3-29 18:14 作者: arthroscopy 時間: 2025-3-29 21:21
A 5-Approximation for Capacitated Facility Location,lgorithm proposed by Zhang . [7] and improves the approximation ratio from 5.83 to 5. We achieve this by modifying the ., . and . operations. The idea of taking linear combinations of inequalities used in Aggarwal .[1] is crucial in achieving this result. The example proposed by Zhang . also shows t作者: Affection 時間: 2025-3-30 00:07 作者: Suppository 時間: 2025-3-30 04:44
A Bicriteria Approximation for the Reordering Buffer Problem,ust move to the corresponding point in the metric. The requests can be processed slightly out of order; in particular, the server has a buffer of capacity . which can store up to . requests as it reads in the sequence. The goal is to reorder the requests in such a manner that the buffer constraint i作者: Torrid 時間: 2025-3-30 09:59
Time-Dependent Route Planning with Generalized Objective Functions, be an approximation of energy consumption, distance, tolls, or other penalties. The resulting problem is NP-hard, but if the additional cost is proportional to driving distance we can solve it optimally on the German road network within 2.3 s using a multi-label A* search. A generalization of time-作者: 召集 時間: 2025-3-30 14:47
New Lower and Upper Bounds for Representing Sequences,unds, and the few lower bounds, known for such representations, and how they interact with the space used. In this article we prove a strong lower bound for ., which holds for rather permissive assumptions on the space used, and give matching upper bounds that require only a compressed representatio作者: 血統(tǒng) 時間: 2025-3-30 19:03 作者: 可互換 時間: 2025-3-31 00:11
The Stretch Factor of ,,- and ,,-Delaunay Triangulations, .,. of such triangulations, we construct a path whose length is no more than . times the Euclidean distance between . and ., and this bound is the best possible. This definitively improves the 25-year old bound of . by Chew (SoCG?’86). This is the first time the stretch factor of the ..-Delaunay tr作者: 商議 時間: 2025-3-31 01:25 作者: Observe 時間: 2025-3-31 07:58
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling,have linear union complexity; for example when the objects are disks, unit cubes or halfspaces in ?.. Another consequence is to show that the real difficulty of many natural capacitated set covering problems lies with solving the associated priority cover problem only, and not with the associated multi-cover problem.作者: 奴才 時間: 2025-3-31 10:10 作者: 使糾纏 時間: 2025-3-31 14:43
Span Programs and Quantum Algorithms for ,-Connectivity and Claw Detection,law. These algorithms can be implemented time efficiently and in logarithmic space. One of the main techniques is to modify the natural .-connectivity span program to drop along the way “breadcrumbs,” which must be retrieved before the path from?. is allowed to enter?..作者: 否認 時間: 2025-3-31 21:17
,über das panamerikanische Abkommen,es, cloud technologies, and more. We will discuss some of these aspects, and reflect on their evolution and on the interplay between the theory and practice of Big Data algorithmics..An extended summary will be available at 作者: 有常識 時間: 2025-4-1 01:37 作者: Kidney-Failure 時間: 2025-4-1 04:51
https://doi.org/10.1007/978-3-531-92450-2dependent contraction hierarchies to the problem yields approximations with negligible errors using running times below 5 ms which makes the model feasible for high-throughput web services. By introducing tolls we get considerably harder instances, but still we have running times below 41 ms and very small errors.作者: HOWL 時間: 2025-4-1 07:19
