Sciweavers

1887 search results - page 72 / 378
» Clustering with Local Restrictions
Sort
View
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
GLOBECOM
2007
IEEE
15 years 4 months ago
Relative Distance Based Localization for Mobile Sensor Networks
— Many sensor network applications exploit the mobility of sensor nodes and the location-awareness plays an important role in these applications. However, it is too expensive to ...
Ji Luo, Qian Zhang
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 8 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
15 years 7 months ago
CORE: Nonparametric Clustering of Large Numeric Databases.
Current clustering techniques are able to identify arbitrarily shaped clusters in the presence of noise, but depend on carefully chosen model parameters. The choice of model param...
Andrej Taliun, Arturas Mazeika, Michael H. Bö...
CLUSTER
2001
IEEE
15 years 1 months ago
NPACI Rocks: Tools and Techniques for Easily Deploying Manageable Linux Clusters
High-performance computing clusters (commodity hardware with low-latency, high-bandwidth interconnects) based on Linux, are rapidly becoming the dominant computing platform for a ...
Philip M. Papadopoulos, Mason J. Katz, Greg Bruno