Sciweavers

455 search results - page 33 / 91
» On Trees and Noncrossing Partitions
Sort
View
DAM
2007
141views more  DAM 2007»
13 years 7 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
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...
IWANN
2009
Springer
14 years 2 months ago
Self Organized Dynamic Tree Neural Network
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...
Juan Francisco de Paz, Sara Rodríguez, Javi...
MKM
2009
Springer
14 years 2 months ago
From Tessellations to Table Interpretation
The extraction of the relations of nested table headers to content cells is automated with a view to constructing narrow domain ontologies of semistructured web data. A taxonomy of...
Ramana C. Jandhyala, Mukkai S. Krishnamoorthy, Geo...
NGC
2000
Springer
115views Communications» more  NGC 2000»
13 years 11 months ago
Hierarchical reliable multicast
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
Athina Markopoulou, Fouad A. Tobagi