作者: construct 時間: 2025-3-21 23:14
A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons, algorithms for the .-partitioning problem are presented. Their time complexities are O(. log..) or O(..log .), depending on the properties of the given .-gon. In most cases, both algorithms find .-partitions with no more than 2.(.) components.作者: daredevil 時間: 2025-3-22 04:10
Connectability problems,ing these problems in a general framework might lead to general solutions. Some solutions are presented. In particular, an .(. log .loglog .) solution is given for determining all pairs of points in a set that can be connected with an axis-parallel rectangle, avoiding a set of obstacle points.作者: 現(xiàn)實 時間: 2025-3-22 05:15 作者: 名字的誤用 時間: 2025-3-22 12:41
Parallel solution of sparse linear systems,of .. The algorithm has two stages. First is a graph-theoretic structure prediction phase, which runs in time .(log..). There follows a numerical computation phase, which runs in time proportional to the height of the elimination tree of . times a log factor.作者: Misgiving 時間: 2025-3-22 16:55 作者: syring 時間: 2025-3-22 20:41 作者: 種植,培養(yǎng) 時間: 2025-3-23 01:02 作者: 商店街 時間: 2025-3-23 02:58
An extrapolation on the interpolation search, found in less than 10 accesses on the average, without using any knowledge of the distribution..There are two basic ideas that accomplish this improvement. One is to allow extrapolation over small intervals, and the other is to use the least-square method to approximate the first probe position in the table.作者: epicardium 時間: 2025-3-23 05:46 作者: languor 時間: 2025-3-23 11:12 作者: Ointment 時間: 2025-3-23 15:08
An implicit binomial queue with constant insertion time,action in logarithmic time. In developing this structure we first introduce a very simple scheme permitting insertions in constant amortized time. This is modified to achieve the worst-case behavior using roughly lg*. pairs of pointers, and finally this pointer requirement is removed.作者: Feedback 時間: 2025-3-23 18:02 作者: 運動吧 時間: 2025-3-24 01:10 作者: EPT 時間: 2025-3-24 04:59 作者: Flounder 時間: 2025-3-24 08:51 作者: 詞匯表 時間: 2025-3-24 13:00 作者: 無法解釋 時間: 2025-3-24 16:04
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniqu results are obtained by enhancing and extending these techniques, and include: (i) An .(..+.)-time (for any δ>0), .(.)-space randomized algorithm for finding all . intersections of . line segments in the plane (we can count the number of these intersections in .(..) time and linear space). (ii) Pre作者: Sad570 時間: 2025-3-24 21:14 作者: 分發(fā) 時間: 2025-3-25 02:26
A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons,ch, where . is given and .<.. First we prove a lower bound .(.) for the number of components in the .-partition of a given .-gon .. Then two heuristic algorithms for the .-partitioning problem are presented. Their time complexities are O(. log..) or O(..log .), depending on the properties of the giv作者: Painstaking 時間: 2025-3-25 03:46 作者: 小丑 時間: 2025-3-25 11:13
Two hybrid methods for collision resolution in open addressing hashing,uce and analyze two hybrid methods, that generalize these basic strategies. The first one uses a probabilistic approach, and the second one uses a “two-phase” strategy, that can be tuned to achieve better performance than FCFS and LCFS.作者: 租約 時間: 2025-3-25 12:28
On an alternative sum useful in the analysis of some data structures,hich has a form of an alternative sum, hence not very convenient for numerical computations. Nevertheless, this solution is useful in deriving asymptotic approximation for the sum. In this note we propose a general approach to derive such asymptotics by applying the residue theorem from the complex 作者: legislate 時間: 2025-3-25 17:47
Bin-packing in 1.5 dimension,e are allowed to cut a rectangle and move the parts horizontally. We describe two relatively simple algorithms for this problem and determine their asymptotic performance ratios. For the best algorithm, we show that this ratio is between 1.302... and 4/3.作者: Spinal-Tap 時間: 2025-3-25 23:19 作者: 怕失去錢 時間: 2025-3-26 01:42 作者: 天文臺 時間: 2025-3-26 07:38 作者: palliative-care 時間: 2025-3-26 12:02 作者: Odyssey 時間: 2025-3-26 15:26 作者: Grasping 時間: 2025-3-26 19:45 作者: Etymology 時間: 2025-3-26 23:34
assumed that Car sales will be affected by external factor in Japan. Japan has problems with the declining birth rate and aging population. Car sales in Japan will be decrease caused by it, so it is necessary for Car industry in japan to know needs of customers. In this study, we analyze customer d作者: 變異 時間: 2025-3-27 04:57
Svante Carlsson,J. Ian Munro,Patricio V. Pobleteps is suggested by the government, we often fail to achieve the goal. Behavioral analytics shows that it needs to give information about evidence-based health to promote changes in individual’s activities..This study aims to determine whether self-monitoring using an accelerometer is associated with作者: STYX 時間: 2025-3-27 08:52 作者: 關(guān)心 時間: 2025-3-27 10:39
Svante Carlsson,Christer Mattssonntly with the Symposium on Human Interface (Japan) 2009, the 8th International Conference on Engineering Psychology and Cognitive Ergonomics, the 5th International Conference on Universal Access in Human-Computer Interaction, the Third International Conf- ence on Virtual and Mixed Reality, the Third作者: 拋物線 時間: 2025-3-27 15:34
Heikki Mannila,Esko Ukkonenntly with the Symposium on Human Interface (Japan) 2009, the 8th International Conference on Engineering Psychology and Cognitive Ergonomics, the 5th International Conference on Universal Access in Human-Computer Interaction, the Third International Conf- ence on Virtual and Mixed Reality, the Third作者: enmesh 時間: 2025-3-27 21:44
Lars Draws,Patrik Eriksson,Erik Forslund,Leif H?glund,S?ren Vallner,Thomas Strothotten Japan, many people don’t understand the importance of reading. In this research, we introduce the concept to postulate that reading is communication between a reader and a book, even though a book is not reactive but non-reactive entity. An idea is to change a book into a reactive entity, and to a作者: 挑剔為人 時間: 2025-3-27 23:58
Derick Woodn Japan, many people don’t understand the importance of reading. In this research, we introduce the concept to postulate that reading is communication between a reader and a book, even though a book is not reactive but non-reactive entity. An idea is to change a book into a reactive entity, and to a作者: 無動于衷 時間: 2025-3-28 02:51
Leonidas Guibas,Mark Overmars,Micha Sharirf the rapid increase in the number of scientific articles published each year. However, whether and how these summaries actually help readers in comprehending scientific papers has not been examined yet. In this work, we study the effectiveness of automatically generated summaries of scientific pape作者: 背信 時間: 2025-3-28 10:11 作者: groggy 時間: 2025-3-28 11:17 作者: Offstage 時間: 2025-3-28 17:03 作者: Capitulate 時間: 2025-3-28 21:13 作者: crockery 時間: 2025-3-28 23:31
Walter Cunto,Patricio V. Pobleterategy organization established in 2000. However, according to the United Nations E-Government Development Index, Japan’s ranking has remained low despite its progress in information infrastructure. The reason for this is that the Japanese government did not integrate the code and standardize the da作者: 禍害隱伏 時間: 2025-3-29 04:34 作者: inveigh 時間: 2025-3-29 10:06
Sven-Olai H?ylandd Data Comm affects the degree to which they come to rely on this tool instead of voice-based, manual tools to manage traffic. The data reported in this study comes from 24 students who took part in one of two semesters of an ATCo training course offered by our organization. One group received littl作者: HIKE 時間: 2025-3-29 12:21 作者: GUILT 時間: 2025-3-29 17:21
Elias Dahlhaus,Marek Karpinskicts from a certain aspect) in multi-dimensional space. For this purpose, the following two methods are proposed from the viewpoint of the number of evaluation criteria which should be considered by a user at one time: (i) the two fixed evaluation criteria are employed to evaluate the solutions; and 作者: restrain 時間: 2025-3-29 23:06 作者: 凹槽 時間: 2025-3-30 03:40 作者: 修正案 時間: 2025-3-30 06:46
Lefteris M. Kirousis,Paul Spirakis real-world problems. In this regard, an intelligent offshore oil industry environment is a very complex scenario and Occupational Health and Security (OHS) is a priority issue as it is an important factor to reduce the number of accidents and incidents records. In the oil industry, there exist stan作者: Chronic 時間: 2025-3-30 10:41
On recognizing and characterizing visibility graphs of simple polygons,In this paper, we establish three necessary conditions for recognizing visibility graphs of simple polygons and conjecture that these conditions are sufficient. We also show that visibility graphs of simple polygons do not posses the characteristics of several special classes of graphs.作者: OTTER 時間: 2025-3-30 15:34 作者: 禁令 時間: 2025-3-30 17:24 作者: 雜役 時間: 2025-3-30 23:41
978-3-540-19487-3Springer-Verlag Berlin Heidelberg 1988作者: TIA742 時間: 2025-3-31 04:06 作者: Hallmark 時間: 2025-3-31 06:45 作者: 殺子女者 時間: 2025-3-31 10:15
Implicit selection,nt of additional space. We show that this problem can be solved in .(.) time in the worst case. In particular, we show that 6.7756.+.(.) comparisons are sufficient if all elements are distinct and 6.8280.+.(.) comparisons are sufficient in the general case.作者: 形上升才刺激 時間: 2025-3-31 16:58
Extremal cost tree data structures,of the same size. We present our latest results in this area for the classes of AVL trees and brother trees, and for the cost measures based on binary comparisons and node visits. We also briefly consider the space cost measure for brother trees and the unbalance cost measure for AVL trees.作者: 虛弱 時間: 2025-3-31 18:55
Two hybrid methods for collision resolution in open addressing hashing,uce and analyze two hybrid methods, that generalize these basic strategies. The first one uses a probabilistic approach, and the second one uses a “two-phase” strategy, that can be tuned to achieve better performance than FCFS and LCFS.作者: mortgage 時間: 2025-4-1 01:23
Bin-packing in 1.5 dimension,e are allowed to cut a rectangle and move the parts horizontally. We describe two relatively simple algorithms for this problem and determine their asymptotic performance ratios. For the best algorithm, we show that this ratio is between 1.302... and 4/3.作者: Arbitrary 時間: 2025-4-1 04:17
Conference proceedings 1988ns present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.作者: 善于騙人 時間: 2025-4-1 08:47
ogistic regression analysis and decision tree analysis to know the difference between the two. After that, we evaluate the accuracy of AUC and confusion matrix as evaluation of both analyses. The analysis shows that customers who buy new cars are affected by the salesperson, and customers who buy us作者: BLOT 時間: 2025-4-1 13:33
Svante Carlsson,J. Ian Munro,Patricio V. Pobleteeir number of steps nor exercise by using the accelerometer continuously. According to Tong and Laranjo (.), self-monitoring is an effective behavior change technique for most people, however, this study shows that self-monitoring does not associated. Second, statistically, at 10% level, a change in作者: 優(yōu)雅 時間: 2025-4-1 18:00
