Sciweavers

1174 search results - page 212 / 235
» Functional Trees
Sort
View
ICS
2010
Tsinghua U.
14 years 7 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
HASKELL
2009
ACM
14 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
FOCS
2007
IEEE
14 years 4 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 4 months ago
Utility-Aware Resource Allocation for Multi-Stream Overlay Multicast
Abstract - Overlay multicast, which performs topology construction and data relaying in the application layer, has recently emerged as a promising vehicle for data distribution. In...
Ji Xu, Jiangchuan Liu, Hsiao-Hwa Chen, Xiao Chu
CIKM
2007
Springer
14 years 4 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu