Sciweavers

10289 search results - page 362 / 2058
» Standard bases in K
Sort
View
CCCG
2007
15 years 8 months ago
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
Sören Laue, Domagoj Matijevic
CLIMA
2008
15 years 8 months ago
Verifying Agents' Conformance with Multiparty Protocols
The paper deals with the problem of agents conformance with multiparty protocols. We introduce a notion of conformance of a set of k agents with a multiparty protocol with k roles,...
Laura Giordano, Alberto Martelli
139
Voted
IEICET
2008
84views more  IEICET 2008»
15 years 6 months ago
Factorization of Square-Free Integers with High Bits Known
Abstract. In this paper we propose an algorithm of factoring any integer N which has k different prime factors with the same bit-length, when ( 1 k+2 + k(k-1) ) log N high-order bi...
Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Ka...
IPL
2006
98views more  IPL 2006»
15 years 6 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
IJSNET
2007
100views more  IJSNET 2007»
15 years 6 months ago
Fault tolerant topology control for one-to-all communications in symmetric wireless networks
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
Feng Wang 0002, Kuai Xu, My T. Thai, Ding-Zhu Du