Sciweavers

490 search results - page 44 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 10 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
ASIACRYPT
2003
Springer
14 years 2 months ago
New Parallel Domain Extenders for UOWHF
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
Wonil Lee, Donghoon Chang, Sangjin Lee, Soo Hak Su...
MDM
2009
Springer
102views Communications» more  MDM 2009»
14 years 3 months ago
Privacy-Aware Proximity Based Services
Proximity based services are location based services (LBS) in which the service adaptation depends on the comparison between a given threshold value and the distance between a use...
Sergio Mascetti, Claudio Bettini, Dario Freni, Xia...
VLDB
1995
ACM
155views Database» more  VLDB 1995»
14 years 13 days ago
Aggregate-Query Processing in Data Warehousing Environments
In this paper we introduce generalized projections (GPs), an extension of duplicateeliminating projections, that capture aggregations, groupbys, duplicate-eliminating projections ...
Ashish Gupta, Venky Harinarayan, Dallan Quass
KAIS
2007
75views more  KAIS 2007»
13 years 8 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann