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

Flexible

書目名稱Applied Algorithms影響因子(影響力)




書目名稱Applied Algorithms影響因子(影響力)學科排名




書目名稱Applied Algorithms網(wǎng)絡公開度




書目名稱Applied Algorithms網(wǎng)絡公開度學科排名




書目名稱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