Sciweavers

727 search results - page 120 / 146
» Private approximation of search problems
Sort
View
COMPGEOM
2007
ACM
14 years 1 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 4 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
IPPS
2000
IEEE
14 years 2 months ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 11 months ago
Fitness calculation approach for the switch-case construct in evolutionary testing
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...
Yan Wang, Zhiwen Bai, Miao Zhang, Wen Du, Ying Qin...
WWW
2005
ACM
14 years 10 months ago
The volume and evolution of web page templates
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
David Gibson, Kunal Punera, Andrew Tomkins