Sciweavers

539 search results - page 36 / 108
» Recurrence relations and fast algorithms
Sort
View
99
Voted
ICC
2009
IEEE
144views Communications» more  ICC 2009»
15 years 7 months ago
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
Virag Shah, Neelesh B. Mehta, Raymond Yim
80
Voted
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 17 days ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
95
Voted
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 1 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
116
Voted
MOBIHOC
2002
ACM
16 years 1 days ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
127
Voted
SI3D
2012
ACM
13 years 8 months ago
Fast, effective BVH updates for animated scenes
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
Daniel Kopta, Thiago Ize, Josef B. Spjut, Erik Bru...