Sciweavers

1068 search results - page 146 / 214
» Extremely randomized trees
Sort
View
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 10 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
PERCOM
2007
ACM
14 years 9 months ago
Dynamic Carrier-Assisted Routing in Mobile Networks
We propose to use node mobility to enhance routing capability in a mobile network. A dual-control planes model is presented, which includes the traditional S(stationary)-plane for ...
Jie Wu
ICS
2010
Tsinghua U.
14 years 7 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
SDM
2009
SIAM
105views Data Mining» more  SDM 2009»
14 years 7 months ago
Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
The annotation of words and phrases by ontology concepts is extremely helpful for semantic interpretation. However many ontologies, e.g. WordNet, are too fine-grained and even hu...
Gerhard Paaß, Frank Reichartz
CVPR
2010
IEEE
14 years 6 months ago
Fast and Robust Object Segmentation with the Integral Linear Classifier
We propose an efficient method, built on the popular Bag of Features approach, that obtains robust multiclass pixellevel object segmentation of an image in less than 500ms, with...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...