Sciweavers

430 search results - page 37 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
VVS
1995
IEEE
132views Visualization» more  VVS 1995»
15 years 2 months ago
Multi-Dimensional Trees for Controlled Volume Rendering and Compression
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
Jane Wilhelms, Allen Van Gelder
PDCN
2004
15 years 10 hour ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 2 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
CCGRID
2003
IEEE
15 years 3 months ago
A Parallel FPT Application For Clusters
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
James Cheetham, Frank K. H. A. Dehne, Andrew Rau-C...
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 3 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han