Sciweavers

153 search results - page 7 / 31
» Uniformity Testing Using Minimal Spanning Tree
Sort
View
CORIA
2007
15 years 1 months ago
L'arbre recouvrant dans l'interrogation de documents XML
In this paper, we propose a fuzzy model to querying the XML documents, by taking into account not only the document contents, but also their structure. The concept of minimal size ...
Abdeslame Alilouar
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 5 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
TCAD
2008
119views more  TCAD 2008»
14 years 11 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
ICML
2004
IEEE
16 years 13 days ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
MOR
2010
98views more  MOR 2010»
14 years 10 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin