Sciweavers

6105 search results - page 864 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
161
Voted
WWW
2003
ACM
16 years 7 months ago
Peer-to-peer architecture for content-based music retrieval on acoustic data
In traditional peer-to-peer search networks, operations focus on properly labeled files such as music or video, and the actual search is often limited to text tags. The explosive ...
Cheng Yang
POPL
2010
ACM
16 years 4 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
SPAA
2009
ACM
16 years 3 months ago
Brief announcement: low depth cache-oblivious sorting
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardha...
ICC
2008
IEEE
110views Communications» more  ICC 2008»
16 years 1 months ago
PAQ: A Starvation-Resistant Alternative to Proportional Fair
Abstract—Proportional Fair (PF) is a frequently used channelaware scheduling algorithm in 3G wireless networks. However, recent work by us and others has shown that, in practice,...
Soshant Bali, Sridhar Machiraju, Hui Zang
ICDCSW
2007
IEEE
16 years 1 months ago
Building Trust in Online Rating Systems Through Signal Modeling
Abstract— Online feedback-based rating systems are gaining popularity. Dealing with unfair ratings in such systems has been recognized as an important but difficult problem. Thi...
Yafei Yang, Yan Lindsay Sun, Jin Ren, Qing Yang