Sciweavers

16430 search results - page 327 / 3286
» On Computable Tree Functions
Sort
View
DAGSTUHL
1996
15 years 6 months ago
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
Michael Leuschel, Bern Martens
ICDM
2010
IEEE
232views Data Mining» more  ICDM 2010»
15 years 2 months ago
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
Heli Sun, Jianbin Huang, Jiawei Han, Hongbo Deng, ...
ICPR
2004
IEEE
16 years 6 months ago
A Unification Framework for Tree and Block Wavelet Encoders
Wavelet transform coefficient encoders are broadly categorized as depending on correlations: across sub-bands through a zerotree, or within sub-bands through a block quad-tree. Th...
Andy C. Downton, Martin Fleury, Xiao Wei Yin
MFCS
2009
Springer
15 years 11 months ago
The Isomorphism Problem for k-Trees Is Complete for Logspace
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
Johannes Köbler, Sebastian Kuhnert
135
Voted
FOCS
2003
IEEE
15 years 10 months ago
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, ...