Sciweavers

4781 search results - page 610 / 957
» Complexity at large
Sort
View
EDBT
2006
ACM
191views Database» more  EDBT 2006»
16 years 5 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
EDBT
2008
ACM
154views Database» more  EDBT 2008»
16 years 5 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis
ICFP
2007
ACM
16 years 5 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
DCC
2006
IEEE
16 years 5 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 2 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...