检索结果-内蒙古大学图书馆

20th Annual Conference on Neural Information Processing Systems, NIPS 2006

作者： Boiman, Oren Irani, Michal Department of Computer Science and Applied Math Weizmann Institute of Science 76100 Rehovot Israel

ISBN: (纸本)9780262195683

We propose a new approach for measuring similarity between two signals, which is applicable to many machine learning tasks, and to many signal types. We say that a signal S1 is "similar" to a signal S 2 if it is "easy" to compose S1 from few large contiguous chunks of S2. Obviously, if we use small enough pieces, then any signal can be composed of any other. Therefore, the larger those pieces are, the more similar S1 is to S2. This induces a local similarity score at every point in the signal, based on the size of its supported surrounding region. These local scores can in turn be accumulated in a principled information-theoretic way into a global similarity score of the entire S1 to S2. "Similarity by Composition" can be applied between pairs of signals, between groups of signals, and also between different portions of the same signal. It can therefore be employed in a wide variety of machine learning problems (clustering, classification, retrieval, segmentation, attention, saliency, labelling, etc.), and can be applied to a wide range of signal types (images, video, audio, biological data, etc.) We show a few such examples.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

AutoDomainMine: A graphical data mining system for process optimization 07

AutoDomainMine: A graphical data mining system for process o...

引用

SIGMOD 2007: ACM SIGMOD International Conference on Management of Data

作者： Varde, Aparna S. Rundensteiner, Elke A. Sisson Jr., Richard D. Department of Math. and Computer Science Virginia State University Petersburg VA United States Department of Computer Science Worcester Polytechnic Institute Worcester MA United States Manufacturing and Materials Science Program Worcester Polytechnic Institute Worcester MA United States

ISBN: (纸本)1595936866

This paper describes a graphical data mining system called AutoDomainMine. It is based on our proposed approach of integrating clustering and classification to mine scientific data stored in a database. The data consists of input conditions of scientific experiments and graphs plotted as their results. This system mines the stored data in order to submit exact or approximate ranked responses to user queries intended to optimize the scientific processes.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

An Analysis of 10-Gigabit Ethernet Protocol Stacks in Multicore Environments

An Analysis of 10-Gigabit Ethernet Protocol Stacks in Multic...

引用

IEEE Symposium on High Performance Interconnects

作者： G. Narayanaswamy P. Balaji W. Feng Department of Computer Science Virginia Technologies USA Math. and Computer Science Argonne National Laboratory USA

This paper analyzes the interactions between the protocol stack (TCP/IP or iWARP over 10-Gigabit Ethernet) and its multicore environment. Specifically, for host-based protocols such as TCP/IP, we notice that a significant amount of processing is statically assigned to a single core, resulting in an imbalance of load on the different cores of the system and adversely impacting the performance of many applications. For host-offloaded protocols such as iWARP, on the other hand, the portions of the communication stack that are performed on the host, such as buffering of messages and memory copies, are closely tied with the associated process, and hence do not create such load imbalances. Thus, in this paper, we demonstrate that by intelligently mapping different processes of an application to specific cores, the imbalance created by the TCP/IP protocol stack can be largely countered and application performance significantly improved. At the same time, since the load is a better balanced in host-offloaded protocols such as iWARP, such mapping does not adversely affect their performance, thus keeping the mapping generic enough to be used with multiple protocol stacks.

关键词： Ethernet networks Protocols Multicore processing TCPIP computer science Network interfaces computer buffers Libraries

来源：评论

学校读者我要写书评

暂无评论

Fraternal Augmentations of graphs, Coloration and Minors

引用

Electronic Notes in Discrete math.matics 2007年 28卷 223-230页

作者： Nešetřil, Jaroslav Ossona de Mendez, Patrice Department of Applied Mathematics Institute of Theoretical Computer Science Charles University Praha Czech Republic Centre d'Analyse Mathématiques Sociales - CNRS UMR 8557 Paris France

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r (G). We generalize to these classes some results proved for proper minor closed classes and bounded degree graphs, such as the existence of low tree-width colorings, a linear time algorithm to check subgraph isomorphism for a fixed pattern and homomorphism dualities. © 2007 Elsevier B.V. All rights reserved.

关键词： Bounded expansion Coloring Graph Algorithm Homomorphism Ramsey number Restricted duality Subgraph Isomorphism Transitive fraternal augmentation Tree-depth

来源：评论

学校读者我要写书评

暂无评论

EXISTENCE AND UNIQUENESS OF THE SOLUTION FOR NONLINEAR THIRD-ORDER ROBIN BOUNDARY VALUE PROBLEM WITH A TURNING POINT

引用

Annals of Differential Equations 2007年第3期23卷 365-372页

作者： Yu Zanping Zhou Zheyan Shen Jianhe School of Math. and Computer Science Fujian Normal University Fuzhou 350007 Dept. of Applied Mechanics and Engineering Sun Yat-sen University Guangzhou 510275

The paper aims to obtain existence and uniqueness of the solution as well as asymptotic estimate of the solution for singularly perturbed nonlinear thirdorder Robin boundary value problem with a turning point. In order to achieve this aim, existence and uniqueness of the solution for third-order nonlinear Robin boundary value problem is derived first based on the upper and lower solutions method under relatively weaker conditions. In this manner, the goal of this paper is gained by applying the existence and uniqueness results mentioned above.

关键词： Robin boundary value problem third-order turning point existence and uniqueness singular perturbation

来源：评论

学校读者我要写书评

暂无评论

Matching Local Self-Similarities across Images and Videos

Matching Local Self-Similarities across Images and Videos

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Eli Shechtman Michal Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

We present an approach for measuring similarity between visual entities (images or videos) based on matching internal self-similarities. What is correlated across images (or across video sequences) is the internal layout of local self-similarities (up to some distortions), even though the patterns generating those local self-similarities are quite different in each of the images/videos. These internal self-similarities are efficiently captured by a compact local "self-similarity descriptor"', measured densely throughout the image/video, at multiple scales, while accounting for local and global geometric distortions. This gives rise to matching capabilities of complex visual data, including detection of objects in real cluttered images using only rough hand-sketches, handling textured objects with no clear boundaries, and detecting complex actions in cluttered video data with no prior learning. We compare our measure to commonly used image-based and video-based similarity measures, and demonstrate its applicability to object detection, retrieval, and action detection.

关键词： Object detection Pixel Image edge detection Distortion measurement Video sequences Image retrieval Filters Heart Image recognition computer science

来源：评论

学校读者我要写书评

暂无评论

A New Interactive Hashing Theorem

A New Interactive Hashing Theorem

引用

Annual IEEE Conference on Computational Complexity

作者： Iftach Haitner Omer Reingold Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO '92), plays an important role in many cryptographic protocols. In particular, it is a major component in all known constructions of statistically- hiding commitment schemes and of zero-knowledge arguments based on general one-way permutations and on one- way functions. Interactive hashing with respect to a one-way permutation f, is a two-party protocol that enables a sender that knows y = f(x) to transfer a random hash z = h(y) to a receiver. The receiver is guaranteed that the sender is committed to y (in the sense that it cannot come up with x and x' such that f(x) Dagger f(x') but h(f(x)) = h(f(x')) = z). The sender is guaranteed that the receiver does not learn any additional information on y. In particular, when h is a two-to-one hash function, the receiver does not learn which of the two pre images {y,y'} = h -1 (z) is the one the sender can invert with respect to f. This paper reexamines the notion of interactive hashing. We give an alternative proof for the Naor et. al. protocol, which seems to us significantly simpler and more intuitive than the original one. Moreover, the new proof achieves much better parameters (in terms of how security preserving the reduction is). Finally, our proof implies a more versatile interactive hashing theorem for a more general setting than that of the Naor et. al. protocol. One generalization relates to the selection of hash function h (allowing much more flexibility). More importantly, the theorem applies to the case where the underlying function f is hard- to-invert only on some given (possibly sparse) subset of the output strings. In other words, the theorem is tuned towards hashing of a value y that may be distributed over a sparse subset of the domain (rather than uniform on the entire domain as a random output of a one-way permutation is). Our interest in interactive hashing is in part as a very appealing object (i.e., independent of any pa

关键词： computer science Cryptographic protocols Cryptography Information security

来源：评论

学校读者我要写书评

暂无评论

Piecewise smooth image compression using normal displacement maps

Piecewise smooth image compression using normal displacement...

引用

26th Picture Coding Symposium, PCS 2007

作者： Van Aerschot, W. Jansen, M. Bultheel, A. Computer Science Dept. K.U. Leuven Celestijnenlaan 200 A B3001 Heverlee Belgium Department of Math. K.U. Leuven Celestijnenlaan 200 B B3001 Heverlee Belgium

ISBN: (纸本)9789898109057

This paper applies the idea of normal mesh techniques, utilized in CG rendering applications of smooth manifolds in 3d space, to piecewise smooth functions defined on the plane. The nonsmoothness of these functions is located along a smoothly varying curve in the domain. The nonlinear nature of the proposed method allows to deal with the 'regularity' of the curve. The smooth curve is approximated by a polyline existing of triangle edges of the adaptively created nested triangulations. The proposed method can be used in transform coders generating sparse representations of piecewise smooth colored images. We state a full compression algorithm to encode images where all information is located in one smooth contour.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) Packet Scheduling Algorithm

Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) ...

引用

IEEE International Conference on Networks

作者： Dessislava Nikolova Chris Blondia Department Math. and Computer Science Performance Analysis of Telecommunication Systems Research Group University of Antwerp Antwerp Belgium

ISBN: (纸本)9781424412297;1424412293

In this article we present a novel packet scheduling algorithm LBFS-DRR, which combines features from the Last-Come First-Served scheduling discipline and the Deficit Round Robin (DRR) algorithm. In comparison with DRR it provides lower average packet delay, while preserving the advantageous feature like O(l) complexity, fairness, bandwidth guarantee. The lower mean delay is realized by giving service in a round first to flows transmitting bellow their (weighted) fair share. The algorithm exploits the high variability in the typical user traffic pattern resulting in lower mean file transfer delay.

关键词： Round robin Scheduling algorithm Delay Processor scheduling Global Positioning System Traffic control Bandwidth computer science Performance analysis Bellows

来源：评论

学校读者我要写书评

暂无评论

A Fast Vessel Centerline Extraction Algorithm for Catheter Simulation

A Fast Vessel Centerline Extraction Algorithm for Catheter S...

引用

Annual IEEE Symposium on computer-Based Medical Systems

作者： Jan Egger Zvonimir Mostarkic Stefan Grosskopf Bernd Freisleben Department of Computed Tomography Siemens Medical Solutions Inc. Forchheim Germany Department of Math. and Computer Science University of Marburg Germany

In this paper, we present a fast and robust algorithm for centerline extraction in blood vessels. The algorithm is suitable for catheter simulation in CT data of blood vessels. It creates an initial centerline based on two user-defined points (start- and endpoint). For curved vessel structures, this initial centerline is computed by Dijkstra's shortest path algorithm. For linear vessel structures, the algorithm directly connects the start- and the endpoint to get the initial centerline. Thereafter, this initial path will be aligned in the blood vessel, resulting in the vessels centerline (i.e. an optimal catheter simulation path). The alignment is done by an active contour model combined with polyhedra placed along it. Results of the proposed centerline algorithm are demonstrated for CTA with variations in anatomy and location of pathology.

关键词： Catheters Blood vessels Biomedical imaging Aneurysm Computational modeling Medical simulation Computed tomography Robustness Active contours Anatomy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：