5153 search results - page 420 / 1031 » Introduction to Randomized Algorithms |
137
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
146
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
168
click to vote
PAKDD
2007
ACM
15 years 11 months ago
2007
ACM
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
113
Voted
COCO
2004
Springer
15 years 10 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
245
Voted
FOCS
1993
IEEE
15 years 9 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...