Dynamic Interface to Enhance Network Efficiency Using Channel Allocation
networks. In the recent past, the routing efficiency and its issues can be solved by various protocols. In this paper we enhanced many to one transmission with AODV protocol
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
networks. In the recent past, the routing efficiency and its issues can be solved by various protocols. In this paper we enhanced many to one transmission with AODV protocol
some of the functionalities that support without reconfiguration or centralized services. In order to solve these problems the notion of spontaneous network is created for some collaborative activity among
method and Newton’s method with fast Fourier transforms which is used to solve the matrix inversion problem. This reduces the complexity from O(N3) to O(2N log2N
this set theoretic characterization proposed a blur-robust algorithm whose main step involves solving simple convex optimization problems. To overcome this problem, the proposed technique is based on computer vision
terms of hardware constraints can be converted to sequence of linear problems and solved using linear equations. System Storage is mentioned using System Coefficient Matrix of user requirement increases Resource
enforce concerns of privacy and security over data associated with multiple users. To solve this problem, we propose a systematic approach for enabling the shared data in OSNs. An access
training samples to improve the text detection accuracy. The multi-orientation problem can be solved using the connected component analysis method. To extract connected components (CCs) in images by using
also used tMAGIC-evidence for evidence problem.We propose a Active merge algorithm to solve time complexity problem and sequence algorithm to solve identification problem
racing (PBR) algorithm that provides the basic statistical information’s which is needed to solve the selection problem, notably estimates of the yi,j and corresponding confidence intervals. It contains
very large data sets. This approach is based on the concept of outlier uncovering solving set, which is a slight subset of the data set that can also be engaged ... order to improve both the communication cost and the…
proposed system confirm that the inter and intradomain resource provisioning and embedding cost effectively solve the VNE problem
consumes power and emits heat which affects the environmental conditions. The Green Cloud computing solves the problem of global warming by providing eco-friendly environment. We studied that the heat
unlabeled data. Subspace clustering is one type of clustering model that solves many normal clustering problems. The both novel subspace clustering algorithms known as fixed and optimal centroids are allows
method of harnessing the power of many computers in a network to solve problems requiring a large number of processing cycles and involving huge amounts of data. The grid computing
allows certain kinds of parallelizable or distributable problems involving large data sets to be solved using computing clusters. This paper introduces our experience of grouping internet users by mining
better to use the ensemble clustering method which uses split and merge approach to solve this problem. In this paper the original mixed dataset is splitted into numeric dataset
Further, the result show that the new approach can provide a new dimension in solving multi-sensor image registration problem. The performance of image registration is evaluated and concluded that
proposes a new methodology for solve the Profit Based Unit Commitment (PBUC) problem. The UC problem is solving to Improved Pre-prepared Power Demand (IPPD) table. In a deregulated environment
unit in DED problems has been approximately represented by a quadratic function and is solved using mathematical programming techniques. Commonly, these mathematical methods require some marginal cost information to…
network are securely exchanged with the help of RSA-CRT. This paper solves the most security problem by user registration and verification phases in the multicast network. The primary advantages
decision process (POMDP) multi-armed bandit problem. We present a structural result method to solve the problem for large networks with number of nodes are used
Dipole antennas are designed using Hallen and Pocklington’s integral equations. Numerical techniques in solving electromagnetic problems are the most common methods which are used, with the budding inventions ... these…
Physical Unclonable Functions (PUFs) are emerging as a powerful security primitive that can potentially solve several security problems. In this paper we proposed a PUF system based on clock network
complicated. Therefore the real time constraint of periodic stream of given nodes can be solved by minimum channel bandwidth reservation. The problem in minimum bandwidth reservation is optimized by using
network conditions and video characteristics and develop an integer program for deterministic packet scheduling. Solving the integer program exactly is typically not computationally tractable, so we develop heuristic…
For authors and organisers
Find the right journal for your paper and submit your manuscript.