Sciweavers

2556 search results - page 223 / 512
» Clustering processes
Sort
View
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
15 years 11 months ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler
145
Voted
ICIAP
2003
ACM
15 years 10 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
ICPADS
2008
IEEE
16 years 1 days ago
Query Management in a Sensor Environment
Traditional sensor network deployments consisted of fixed infrastructures and were relatively small in size. More and more, we see the deployment of ad-hoc sensor networks with h...
Martin F. O'Connor, Vincent Andrieu, Mark Roantree
164
Voted
CCGRID
2009
IEEE
16 years 11 days ago
Improving Parallel Write by Node-Level Request Scheduling
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa
ICCV
2009
IEEE
15 years 3 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas