Sciweavers

2492 search results - page 180 / 499
» On the General Signature Trees
Sort
View
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
16 years 3 days ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 8 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 6 months ago
Decision tree modeling with relational views
Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to appl...
Fadila Bentayeb, Jérôme Darmont
TKDE
1998
122views more  TKDE 1998»
15 years 6 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar