Sciweavers

672 search results - page 97 / 135
» Almost Optimal Dispersers
Sort
View
CSR
2007
Springer
14 years 2 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
14 years 2 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
HPCC
2007
Springer
14 years 2 months ago
Performance Evaluation of View-Oriented Parallel Programming on Cluster of Computers
Abstract. View-Oriented Parallel Programming(VOPP) is a novel programming style based on Distributed Shared Memory, which is friendly and easy for programmers to use. In this paper...
Haifeng Shang, Jiaqi Zhang, Wenguang Chen, Weimin ...
VLDB
2007
ACM
138views Database» more  VLDB 2007»
14 years 2 months ago
Minimality Attack in Privacy Preserving Data Publishing
Data publishing generates much concern over the protection of individual privacy. In the well-known kanonymity model and the related models such as l-diversity and (α, k)-anonymi...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, J...
FOCS
2006
IEEE
14 years 2 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans