Sciweavers

2853 search results - page 66 / 571
» Finding related tables
Sort
View
NETWORKS
2006
13 years 10 months ago
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
Stefan Hougardy, Stefan Kirchner
JSC
2006
85views more  JSC 2006»
13 years 10 months ago
SumCracker: A package for manipulating symbolic sums and related objects
We describe a new software package, named SumCracker, for proving and finding identities involving symbolic sums and related objects. SumCracker is applicable to a wide range of e...
Manuel Kauers
TABLETOP
2006
IEEE
14 years 4 months ago
Experiences with and Observations of Direct-Touch Tabletops
The design of multi-touch multi-user tabletop user interfaces is still in its infancy and is not yet well understood. To date, published experimental results have primarily focuse...
Kathy Ryall, Clifton Forlines, Chia Shen, Meredith...
VLDB
1990
ACM
104views Database» more  VLDB 1990»
14 years 2 months ago
Hash-Based Join Algorithms for Multiprocessor Computers
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
Hongjun Lu, Kian-Lee Tan, Ming-Chien Shan
APWEB
2008
Springer
14 years 8 days ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
Xiaoxun Sun, Hua Wang, Jiuyong Li