Sciweavers

1227 search results - page 245 / 246
» Approximate Kernel Clustering
Sort
View
ALGOSENSORS
2009
Springer
13 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
CMA
2010
134views more  CMA 2010»
13 years 7 months ago
Particle tracking for fractional diffusion with two time scales
Abstract. Previous work [51] showed how to solve time-fractional diffusion equations by particle tracking. This paper extends the method to the case where the order of the fraction...
Mark M. Meerschaert, Yong Zhang, Boris Baeumer
KAIS
2011
129views more  KAIS 2011»
13 years 4 months ago
Counting triangles in real-world networks using projections
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...
Charalampos E. Tsourakakis
TKDE
2011
234views more  TKDE 2011»
13 years 4 months ago
The World in a Nutshell: Concise Range Queries
—With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PD...
Ke Yi, Xiang Lian, Feifei Li, Lei Chen 0002
WWW
2011
ACM
13 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...