標(biāo)題: Titlebook: Applied Algorithms; First International Prosenjit Gupta,Christos Zaroliagis Conference proceedings 2014 Springer International Publishing [打印本頁] 作者: Flexible 時間: 2025-3-21 18:11
書目名稱Applied Algorithms影響因子(影響力)
書目名稱Applied Algorithms影響因子(影響力)學(xué)科排名
書目名稱Applied Algorithms網(wǎng)絡(luò)公開度
書目名稱Applied Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Applied Algorithms被引頻次
書目名稱Applied Algorithms被引頻次學(xué)科排名
書目名稱Applied Algorithms年度引用
書目名稱Applied Algorithms年度引用學(xué)科排名
書目名稱Applied Algorithms讀者反饋
書目名稱Applied Algorithms讀者反饋學(xué)科排名
作者: 輕率的你 時間: 2025-3-21 21:32
Monitoring Distributed, Heterogeneous Data Streams: The Emergence of Safe Zones data streams to a central node and process them there. Often, the monitoring problem consists of determining whether the value of a global function, which depends on the union of all streams, crossed a certain threshold. A great deal of effort is directed at reducing communication overhead by trans作者: HAIL 時間: 2025-3-22 03:04
Exploiting Heterogeneous Data Sources: A Computing Paradigm for Live Web and Sustainability Applicatvolutionary technologies are creating an explosion on the size and variety of information that is becoming available. Such technologies include the development and widespread adoption of networks of small and inexpensive embedded sensors that are being used to instrument the environment at an unprec作者: Aqueous-Humor 時間: 2025-3-22 07:49 作者: 意外 時間: 2025-3-22 12:11
A Digital-Geometric Algorithm for Generating a Complete Spherical Surface in??3f some holes (absentee voxels) in its spherical surface of revolution. This incompleteness calls for a proper characterization of the absentee voxels whose restoration in the surface of revolution can ensure the required completeness. In this paper, we present a characterization of the absentee voxe作者: GRAZE 時間: 2025-3-22 16:43
Bar 1-Visibility Drawings of 1-Planar Graphsa vertical line segment between its incident vertices such that each edge crosses at most one bar. A graph . is bar 1-visible if . has a bar 1-visibility drawing. A graph . is 1-planar if . can be drawn in the plane such that each edge has at most one crossing. In this paper we give .(.) time algori作者: canonical 時間: 2025-3-22 19:01
Search Strategies for Subgraph Isomorphism Algorithmsassign pattern nodes to compatible nodes in the target graph. It is well known that the order in which nodes are assigned, a so-called search strategy, influences drastically the size of the search space. In this article we investigate the impact of various search strategies on the efficiency of two作者: 羊齒 時間: 2025-3-23 00:17 作者: 極肥胖 時間: 2025-3-23 02:38 作者: PLIC 時間: 2025-3-23 07:35
An Efficient ID Based Security Algorithm for Mutual Node Authentication and Key Management: An Ellip of the major and attractive fields of research in computer network. The importance of Elliptic Curve Cryptography (ECC) in this field is increasing rapidly because of its smaller key size compare to other known public-key algorithms. Several user authentication and key management algorithms or sche作者: FLORA 時間: 2025-3-23 10:25
Automata for Modeling the Distributed Probabilistic Reversible Processeso relies on backtracking as the basis to make a system fault tolerant. Here, the basic concepts of non-probabilistic automata have been extended by introducing the discrete probabilities on the set of transitions for modelling the probabilistic nature of computing environment. In addition, concurren作者: GORGE 時間: 2025-3-23 15:11 作者: 燈絲 時間: 2025-3-23 19:08
Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windowsng problem for tourists interested in visiting multiple points of interest (POIs) using public transport. The main objective of this problem is to select POIs that match tourist preferences, while taking into account a multitude of parameters and constraints and respecting the time available for sig作者: Amenable 時間: 2025-3-24 00:33
Color Texture Image Segmentation Based on Neutrosophic Set and Nonsubsampled Contourlet Transformatis proposed. This method uses both color and texture features for segmentation. Input image is transformed into LUV color model for extracting the color features. Texture features are extracted from the grayscale image. Image is then transformed into Neutrosophic domain. Finally, image segmentation i作者: 清楚 時間: 2025-3-24 02:21 作者: 過濾 時間: 2025-3-24 07:05 作者: exhilaration 時間: 2025-3-24 10:46
Too Long-Didn’t Read: A Practical Web Based Approach towards Text Summarizationl this information, or only a tiny amount of it is actually read. Therefore, it is imperative to contrive a generic text summarization technique. In this paper, we propose a web based and domain independent automatic text summarization method. The method focuses on generating an arbitrary length sum作者: 盡責(zé) 時間: 2025-3-24 15:13
A Comparative Study of Tag SNP Selection Using Clusteringedical researchers and automatic algorithms. SNPs are confirmed as a major factor in human genome polymorphisms, and are found to be suitable as a genetic marker for disease characteristics. SNPs hold much promise as a basis for genome-wide disease-gene association. Determining the relationship betw作者: 腐敗 時間: 2025-3-24 22:25
Application of Spectral Unmixing Algorithm on Hyperspectral Data for Mangrove Species Classificationcount the multi-path effects of radiation between endmember spectra that may occur before final interception by the sensor. Non linear models represent naturally occurring situations more accurately such as that commonly found within the mangrove forests where a variety of species co-exist as a mixe作者: BUST 時間: 2025-3-25 02:59
https://doi.org/10.1007/978-3-319-04126-1elliptic curve cryptography; fuzzy clustering; multi-path interaction; self organising map; social netwo作者: 態(tài)學(xué) 時間: 2025-3-25 04:13 作者: 高深莫測 時間: 2025-3-25 10:35
Algorithmic Challenges in Digital Microfluidic Biochips: Protocols, Design, and Test review article, we will elaborate on several algorithmic challenges that arise while realizing biochemical protocols on a digital microfluidic (DMF) lab-on-a-chip. In particular, we will focus on certain design automation issues of sample preparation, dilution gradient generation, layout planning, and testing of DMF biochips.作者: Licentious 時間: 2025-3-25 14:27
Choosing and Working of an Anonymous Leaderde as an anonymous leader and subsequent communication to and from this leader such that its identity is not revealed. We give indistinguishability definitions for anonymous leader and prove it to be secure in an arbitrary reliable network.作者: thalamus 時間: 2025-3-25 18:34
Prosenjit Gupta,Christos ZaroliagisUp-to-date results.State-of-the-art research.Fast-track conference proceedings作者: 庇護 時間: 2025-3-25 22:31 作者: 增減字母法 時間: 2025-3-26 01:58 作者: 和平主義 時間: 2025-3-26 07:38 作者: MUMP 時間: 2025-3-26 08:40 作者: SLING 時間: 2025-3-26 13:38
https://doi.org/10.1007/978-3-319-93518-8 review article, we will elaborate on several algorithmic challenges that arise while realizing biochemical protocols on a digital microfluidic (DMF) lab-on-a-chip. In particular, we will focus on certain design automation issues of sample preparation, dilution gradient generation, layout planning, 作者: Directed 時間: 2025-3-26 20:28 作者: colloquial 時間: 2025-3-26 23:42 作者: Resistance 時間: 2025-3-27 04:42
The Latin American Studies Book Seriesver hampered by the difficulty of constructing such objects. In this paper, we present a dimension independent algorithm to build an .-dimensional cellular complex with linear geometries from its isolated (.???1)-dimensional faces represented as combinatorial maps. It does so by efficiently finding 作者: vector 時間: 2025-3-27 08:55 作者: RODE 時間: 2025-3-27 10:35
Making the Electricity Sector Emission-Free,a vertical line segment between its incident vertices such that each edge crosses at most one bar. A graph . is bar 1-visible if . has a bar 1-visibility drawing. A graph . is 1-planar if . can be drawn in the plane such that each edge has at most one crossing. In this paper we give .(.) time algori作者: Lamina 時間: 2025-3-27 15:03 作者: 鄙視讀作 時間: 2025-3-27 19:06
Making the Electricity Sector Emission-Free,MF) lab-on-a-chip (LoC). On-chip dilution of a sample on a DMF biochip involves several mix-split steps, which often suffer from the inaccuracies caused by unbalanced splitting of micro-fluid droplets. Also, error minimization is essential because of the limited availability of the stock solutions a作者: 拱形面包 時間: 2025-3-27 23:06
https://doi.org/10.1007/978-3-030-79713-3de as an anonymous leader and subsequent communication to and from this leader such that its identity is not revealed. We give indistinguishability definitions for anonymous leader and prove it to be secure in an arbitrary reliable network.作者: 品牌 時間: 2025-3-28 03:31 作者: Prognosis 時間: 2025-3-28 08:27 作者: craven 時間: 2025-3-28 14:17 作者: 使困惑 時間: 2025-3-28 16:50
Partha Pratim Saikia,Kishor Goswaming problem for tourists interested in visiting multiple points of interest (POIs) using public transport. The main objective of this problem is to select POIs that match tourist preferences, while taking into account a multitude of parameters and constraints and respecting the time available for sig作者: ANA 時間: 2025-3-28 21:32 作者: athlete’s-foot 時間: 2025-3-29 00:23 作者: 擁護 時間: 2025-3-29 06:22 作者: 象形文字 時間: 2025-3-29 08:51
Partha Pratim Saikia,Kishor Goswamil this information, or only a tiny amount of it is actually read. Therefore, it is imperative to contrive a generic text summarization technique. In this paper, we propose a web based and domain independent automatic text summarization method. The method focuses on generating an arbitrary length sum作者: Hyperplasia 時間: 2025-3-29 15:29 作者: 跳動 時間: 2025-3-29 18:17
Energy, Climate and the Environmentcount the multi-path effects of radiation between endmember spectra that may occur before final interception by the sensor. Non linear models represent naturally occurring situations more accurately such as that commonly found within the mangrove forests where a variety of species co-exist as a mixe作者: staging 時間: 2025-3-29 20:42
https://doi.org/10.1007/978-981-19-3540-4butions at the distinct nodes. To remedy this, we propose a general approach for geometric monitoring of heterogeneous streams (HGM), which defines constraints tailored to fit the distinct data distributions at the nodes. While optimally selecting the constraints is an NP-hard problem, we provide a 作者: 叢林 時間: 2025-3-30 02:12
https://doi.org/10.1007/978-981-19-0280-2has been termed the Live Web. In this talk we present recent research work motivated by the trends we describe above. We also consider how such novel research results are enabling forms of computation. First, we focus on the specific problem of finding events or trends, including spatiotemporal patt作者: 遠(yuǎn)足 時間: 2025-3-30 04:15
Energy, Climate and the Environmentthout making any distinctions between states and actions by which some of the previous formalism suffers; second, association of memory with the automata that preserves concurrency during backtracking; third, the implementation of the . operator to facilitate the concurrency. Although, the full prob作者: Flu表流動 時間: 2025-3-30 11:20
The Politics of Some Policy Instruments,then the cardinality of the seed set i.e. the number of influential nodes needed, is considerably reduced. Also, the experimental results show that the influential nodes can be characterized by their high betweenness values.作者: esculent 時間: 2025-3-30 14:52
https://doi.org/10.1007/978-981-97-1773-6 be the best online algorithm [2] in the literature. In this paper, we have proposed a novel variant of MTF algorithm, which we popularly call as Move-to-Front-or-Middle(MFM). We have performed an empirical study of MFM algorithm and comparative performance analysis with MTF algorithm using two data作者: Insul島 時間: 2025-3-30 16:41 作者: intricacy 時間: 2025-3-30 23:43 作者: 相互影響 時間: 2025-3-31 02:10
Automata for Modeling the Distributed Probabilistic Reversible Processesthout making any distinctions between states and actions by which some of the previous formalism suffers; second, association of memory with the automata that preserves concurrency during backtracking; third, the implementation of the . operator to facilitate the concurrency. Although, the full prob作者: 一小塊 時間: 2025-3-31 06:35
Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Setthen the cardinality of the seed set i.e. the number of influential nodes needed, is considerably reduced. Also, the experimental results show that the influential nodes can be characterized by their high betweenness values.作者: alleviate 時間: 2025-3-31 11:21 作者: ornithology 時間: 2025-3-31 15:27 作者: impaction 時間: 2025-3-31 19:57
The Latin American Studies Book Seriest objects of any dimension. We briefly describe combinatorial maps, present our algorithm using them as a base, and show an example using 2D, 3D and 4D objects which was verified to be correct, both manually and using automated methods.作者: 揮舞 時間: 2025-3-31 23:10
Making the Electricity Sector Emission-Free,e presence of volumetric errors that may occur during the splitting process. Our analysis exposes many interesting error behaviors and indicates possible solutions to correct them in a cyber-physical microfluidic platform.作者: aspect 時間: 2025-4-1 03:08
