Sciweavers

64 search results - page 7 / 13
» Distributed Spanning Tree Algorithms for Large Scale Travers...
Sort
View
IFIP12
2008
13 years 9 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
VTC
2006
IEEE
117views Communications» more  VTC 2006»
14 years 1 months ago
Optimum Fair Bandwidth Allocation Scheme for IEEE 802.16 Mesh Mode with Directional Antenna
— The IEEE 802.16 standard is providing support for Mesh networks of which two scheduling mechanisms (i.e., centralized scheduling and distributed scheduling) are proposed. Centr...
Yanbin Lu, Guoqing Zhang
WWW
2011
ACM
13 years 2 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
CGF
2008
144views more  CGF 2008»
13 years 8 months ago
Deformation-Driven Shape Correspondence
Non-rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistan...
Hao Zhang 0002, Alla Sheffer, Daniel Cohen-Or, Qua...
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter