咨询与建议

限定检索结果

文献类型

  • 9 篇 期刊文献

馆藏范围

  • 9 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 8 篇 工学
    • 8 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 1 篇 电子科学与技术(可...
  • 1 篇 理学
    • 1 篇 数学

主题

  • 9 篇 time-optimal alg...
  • 7 篇 parallel algorit...
  • 5 篇 meshes with mult...
  • 4 篇 lower bounds
  • 3 篇 pattern recognit...
  • 2 篇 compaction
  • 2 篇 dominance graph
  • 2 篇 visibility graph
  • 2 篇 image processing
  • 2 篇 vlsi
  • 2 篇 cad
  • 2 篇 robotics
  • 2 篇 enhanced meshes
  • 1 篇 query processing
  • 1 篇 intersection
  • 1 篇 routing
  • 1 篇 circuit design
  • 1 篇 digital geometry
  • 1 篇 polygons
  • 1 篇 tree reconstruct...

机构

  • 5 篇 old dominion uni...
  • 2 篇 elizabeth city s...
  • 1 篇 univ ottawa dept...
  • 1 篇 department of co...
  • 1 篇 department of co...
  • 1 篇 department of co...
  • 1 篇 univ western aus...
  • 1 篇 univ ottawa dept...
  • 1 篇 so illinois univ...
  • 1 篇 univ western aus...
  • 1 篇 department of co...

作者

  • 7 篇 olariu s
  • 6 篇 schwing jl
  • 5 篇 gurla h
  • 4 篇 bokka v
  • 3 篇 bhagavathi d
  • 2 篇 stojmenovic i
  • 2 篇 d. bhagavathi
  • 2 篇 s. olariu
  • 2 篇 wilson l
  • 1 篇 w. shen
  • 1 篇 l. wilson
  • 1 篇 zomaya a
  • 1 篇 j. zhang
  • 1 篇 zomaya ay
  • 1 篇 zhang jy
  • 1 篇 zhang j
  • 1 篇 j. l. schwing
  • 1 篇 bokka vv

语言

  • 7 篇 英文
  • 2 篇 其他
检索条件"主题词=time-optimal algorithms"
9 条 记 录,以下是1-10 订阅
排序:
time-optimal VISIBILITY-RELATED algorithms ON MESHES WITH MULTIPLE BROADCASTING
收藏 引用
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1995年 第7期6卷 687-703页
作者: BHAGAVATHI, D BOKKA, VV GURLA, H OLARIU, S SCHWING, JL STOJMENOVIC, I ZHANG, JY OLD DOMINION UNIV DEPT COMP SCINORFOLKVA 23529 UNIV OTTAWA DEPT COMP SCIOTTAWAON K1N 9B4CANADA ELIZABETH CITY STATE UNIV DEPT MATH & COMP SCIELIZABETH CITYNC 27909
Given a collection of objects in the plane along with a viewpoint omega, the visibility problem involves determining the portion of each object that is visible to an observer positioned at omega. The visibility proble... 详细信息
来源: 评论
time- and cost-optimal parallel algorithms for the dominance and visibility graphs
收藏 引用
VLSI DESIGN 1996年 第1期4卷 33-40页
作者: Bhagavathi, D Gurla, H Olariu, S Schwing, JL Zhang, J OLD DOMINION UNIV DEPT COMP SCINORFOLKVA 23529 ELIZABETH CITY STATE UNIV DEPT MATH & COMP SCIELIZABETH CITYNC 27909
The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility rela... 详细信息
来源: 评论
time-optimal DIGITAL GEOMETRY algorithms ON MESHES WITH MULTIPLE BROADCASTING
收藏 引用
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 1995年 第4期9卷 601-613页
作者: BOKKA, V GURLA, H OLARIU, S SCHWING, JL STOJMENOVIC, I OLD DOMINION UNIV DEPT COMP SCINORFOLKVA 23529 UNIV OTTAWA DEPT COMP SCIOTTAWAONCANADA
The main contribution of this work is to show that a number of digital geometry problems can be solved elegantly on meshes with multiple broadcasting by using a time-optimal solution to the leftmost one problem as a b... 详细信息
来源: 评论
time-optimal tree computations on sparse meshes
收藏 引用
DISCRETE APPLIED MATHEMATICS 1997年 第3期77卷 201-220页
作者: Bhagavathi, D Bokka, V Gurla, H Olariu, S Schwing, JL OLD DOMINION UNIV DEPT COMP SCINORFOLKVA 23529 SO ILLINOIS UNIV DEPT COMP SCIEDWARDSVILLEIL 62026
The main goal of this work is to fathom the suitability of the mesh with multiple broadcasting architecture (MMB) for some tree-related computations. We view our contribution at two levels: on the one hand, we exhibit... 详细信息
来源: 评论
A time-optimal solution to a classification problem in ordered functional domains, with applications
收藏 引用
PATTERN RECOGNITION 1997年 第9期30卷 1555-1564页
作者: Bokka, V Olariu, S Schwing, JL Wilson, L Zomaya, A OLD DOMINION UNIV DEPT COMP SCINORFOLKVA 23529 UNIV WESTERN AUSTRALIA DEPT ELECT & ELECT ENGNPERTHWA 6007AUSTRALIA
Consider a family C of classifiers represented by continuous functions stored, in discretized form, one function per processor in one column of a mesh with multiple broadcasting of size root n x root n. In a number of... 详细信息
来源: 评论
time-optimal domain-specific querying on enhanced meshes
收藏 引用
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1997年 第1期8卷 13-24页
作者: Bokka, V Gurla, H Olariu, S Schwing, JL Wilson, L Department of Computer Science Old Dominion University Norfolk VA USA
Query processing is a crucial component of various application domains including information retrieval, database design and management, pattern recognition, robotics, and VLSI. Many of these applications involve data ... 详细信息
来源: 评论
A time- and cost-optimal algorithm for interlocking sets - With applications
收藏 引用
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1996年 第10期7卷 1009-1025页
作者: Olariu, S Zomaya, AY UNIV WESTERN AUSTRALIA DEPT ELECT & ELECT ENGNPARALLEL COMP RES LABPERTHWA 6007AUSTRALIA
Given a family I of intervals, two intervals in I interlock if they overlap but neither of them strictly contains the other. A set of intervals in which every two are related in the reflexive transitive closure of the... 详细信息
来源: 评论
CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING
收藏 引用
Parallel Processing Letters 1992年 第2N03期2卷 249-256页
作者: D. BHAGAVATHI S. OLARIU J. L. SCHWING J. ZHANG Department of Computer Science Old Dominion University Norfolk VA 23529-0162 USA
We propose time-optimal algorithms for a number of convex polygon problems on meshes with multiple broadcasting. Specifically, we show that on a mesh with multiple broadcasting of size n × n, the task of deciding... 详细信息
来源: 评论
A UNIFYING LOOK AT SEMIGROUP COMPUTATIONS ON MESHES WITH MULTIPLE BROADCASTING
收藏 引用
Parallel Processing Letters 1994年 第1N02期4卷 73-82页
作者: D. BHAGAVATHI S. OLARIU W. SHEN L. WILSON Department of Computer Science Southern Illinois University Edwardsville IL 62026 USA Department of Computer Science Old Dominion University Norfolk VA 23529 USA
Given a sequence of m items α 1 , α 2 ,…, α m from a semigroup S with an associative operation ⊕, the semigroup computation problem involves computing α 1 ⊕ α 2 ⊕…⊕ α m . We consider the semigroup computat... 详细信息
来源: 评论