Sciweavers

4926 search results - page 817 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 8 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
VLDB
2006
ACM
122views Database» more  VLDB 2006»
14 years 8 months ago
A secure distributed framework for achieving k-anonymity
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
Wei Jiang, Chris Clifton
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
14 years 2 months ago
Straightest Paths on Meshes by Cutting Planes
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to c...
Sungyeol Lee, Joonhee Han, Haeyoung Lee
CG
2004
Springer
14 years 1 months ago
Current Challenges in Multi-player Game Search
Abstract. Years of work have gone into algorithms and optimizations for twoplayer perfect-information games such as Chess and Checkers. It is only more recently that serious resear...
Nathan R. Sturtevant
APNOMS
2006
Springer
13 years 11 months ago
Performance Analysis of Service Differentiation for IEEE 802.15.4 Slotted CSMA/CA
In this paper, we propose two mechanisms, differentiation by backoff exponent and differentiation by the size of contention window, for IEEE 802.15.4 sensor networks to provide mul...
Meejoung Kim