Titlebook: Applied Algorithms; First International Prosenjit Gupta,Christos Zaroliagis Conference proceedings 2014 Springer International Publishing

Flexible

书目名称Applied Algorithms影响因子(影响力)




书目名称Applied Algorithms影响因子(影响力)学科排名




书目名称Applied Algorithms网络公开度




书目名称Applied Algorithms网络公开度学科排名




书目名称Applied Algorithms被引频次




书目名称Applied Algorithms被引频次学科排名




书目名称Applied Algorithms年度引用




书目名称Applied Algorithms年度引用学科排名




书目名称Applied Algorithms读者反馈




书目名称Applied Algorithms读者反馈学科排名

轻率的你

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

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

意外

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

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

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

羊齿

极肥胖

PLIC

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