Sciweavers

399 search results - page 73 / 80
» aim 2000
Sort
View
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
13 years 12 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
CRYPTO
2000
Springer
151views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
New Public-Key Cryptosystem Using Braid Groups
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...
Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo...
CSEE
2000
Springer
13 years 12 months ago
Technology Transfer Issues for Formal Methods of Software Specification
Accurate and complete requirements specifications are crucial for the design and implementation of high-quality software. Unfortunately, the articulation and verification of softw...
Ken Abernethy, John C. Kelly, Ann E. Kelley Sobel,...
ECAI
2000
Springer
13 years 12 months ago
Gaining Insights into Web Customers using Web Intelligence
The web is fast maturing into an important marketing medium that provides businesses with the ability to undertake oneto-one marketing and provide personalised services to their cu...
Sarabjot S. Anand, Matthias Baumgarten, Alex G. B&...
IEEEPACT
1999
IEEE
13 years 12 months ago
On Reducing False Sharing while Improving Locality on Shared Memory Multiprocessors
The performance of applications on large shared-memory multiprocessors with coherent caches depends on the interaction between the granularity of data sharing, the size of the coh...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...