612 search results - page 89 / 123 » Locality in structured peer-to-peer networks |
ACL
2010
13 years 8 months ago
2010
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
NIPS
2007
13 years 11 months ago
2007
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
WWW
2010
ACM
14 years 5 months ago
2010
ACM
In modern Web applications, style formatting and layout calculation often account for a substantial amount of local Web page processing time. In this paper1 , we present two novel...
KAIS
2011
13 years 5 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...