Sciweavers

3110 search results - page 397 / 622
» On the initialization of the DNMF algorithm
Sort
View
ICCV
1999
IEEE
16 years 8 months ago
Segmentation using Eigenvectors: A Unifying View
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
Yair Weiss
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
16 years 7 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
16 years 22 days ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
INFOCOM
2002
IEEE
15 years 11 months ago
Guaranteed Scheduling for Switches with Configuration Overhead
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
Brian Towles, William J. Dally
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
15 years 10 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...