1064 search results - page 203 / 213 » Single Tree Grammars |
ADC
2003
Springer
14 years 17 days ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
ECCV
2010
Springer
14 years 10 days ago
2010
Springer
Detecting shadows from images can significantly improve the performance of several vision tasks such as object detection and tracking. Recent approaches have mainly used illuminat...
INFOCOM
2002
IEEE
14 years 8 days ago
2002
IEEE
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
CCO
2001
Springer
13 years 12 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ICDT
2001
ACM
13 years 11 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...