Sciweavers

2487 search results - page 173 / 498
» Partitions of Graphs into Trees
Sort
View
126
Voted
CORR
2007
Springer
60views Education» more  CORR 2007»
15 years 3 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
137
Voted
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 5 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
99
Voted
ICTAI
2008
IEEE
15 years 10 months ago
Adaptive Mobile Interfaces through Grammar Induction
This paper presents a grammar-induction based approach to partitioning a Web page into several small pages while each small page fits not only spatially but also logically for mob...
Jun Kong, Kevin L. Ates, Kang Zhang, Yan Gu
137
Voted
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 4 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
159
Voted
SI3D
1995
ACM
15 years 7 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater