Sciweavers

307 search results - page 19 / 62
» Low-Distortion Embeddings of Trees
Sort
View
ISSS
1995
IEEE
100views Hardware» more  ISSS 1995»
13 years 11 months ago
Optimal code generation for embedded memory non-homogeneous register architectures
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Guido Araujo, Sharad Malik
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen
CASCON
2004
110views Education» more  CASCON 2004»
13 years 9 months ago
Investigations in tree locking for compiled database applications
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
Heng Yu, Grant E. Weddell
COMBINATORICS
2007
69views more  COMBINATORICS 2007»
13 years 7 months ago
On the Number of Genus One Labeled Circle Trees
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-...
Karola Mészáros
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 8 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...