Sciweavers

15033 search results - page 265 / 3007
» Complexity Theory and Algorithms
Sort
View
CGVR
2006
15 years 6 months ago
Local Z-Buffering Rendering in Large Complex Scenes
- A novel output sensitive real-time rendering algorithm local Z-buffering for the large complex scenes is presented in this paper. A na
Xiaoxu Han
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 5 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
DCC
2006
IEEE
16 years 4 months ago
Optimal Index Assignment for Multiple Description Lattice Vector Quantization
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
Xiang Huang, Xiaolin Wu
151
Voted
FOCS
2003
IEEE
15 years 10 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
CIKM
2000
Springer
15 years 9 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...