Sciweavers

4095 search results - page 425 / 819
» How to test a tree
Sort
View
179
Voted
VLDB
2005
ACM
180views Database» more  VLDB 2005»
15 years 11 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...
INFOCOM
2003
IEEE
15 years 11 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
DOLAP
2003
ACM
15 years 11 months ago
Spatial hierarchy and OLAP-favored search in spatial data warehouse
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
Fangyan Rao, Long Zhang, Xiulan Yu, Ying Li, Ying ...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 11 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
SPAA
2010
ACM
15 years 11 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...