3055 search results - page 309 / 611 » Randomized Search Trees |
135
click to vote
DAC
2008
ACM
16 years 4 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
111
Voted
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
Automatic classification of web pages is an effective way to deal with the difficulty of retrieving information from the Internet. Although there are many automatic classification...
129
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
128
click to vote
IR
2010
15 years 1 months ago
2010
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
138
Voted
SIAMCOMP
2002
15 years 3 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...