2600 search results - page 282 / 520 » Clustering with or without the Approximation |
139
click to vote
SI3D
2009
ACM
16 years 28 days ago
2009
ACM
This paper presents a method for quickly constructing a highquality approximate visibility function for high frequency semitransparent geometry such as hair. We can then reconstru...
170
Voted
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
160
click to vote
CRYPTO
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
159
Voted
ICRA
2008
IEEE
16 years 17 days ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
138
click to vote
CC
2007
Springer
16 years 10 days ago
2007
Springer
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...