4112 search results - page 520 / 823 » Efficient Algorithms for the Spoonerism Problem |
215
click to vote
SDM
2010
SIAM
15 years 9 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
216
click to vote
NETWORKING
2008
15 years 8 months ago
2008
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
191
click to vote
NIPS
2008
15 years 8 months ago
2008
We provide a new analysis of an efficient margin-based algorithm for selective sampling in classification problems. Using the so-called Tsybakov low noise condition to parametrize...
198
Voted
UAI
2001
15 years 8 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
157
click to vote
WSCG
2003
15 years 8 months ago
2003
In the classical shading algorithm according to Phong, the normal is interpolated across the scanline, requiring a computationally expensive normalization in the inner loop. In th...