Sciweavers

1279 search results - page 106 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
14 years 2 months ago
Approximate Video Search Based on Spatio-Temporal Information of Video Objects
The spatio-temporal information of a video object is important for content-based video retrieval. In this paper the spatio-temporal information of a video object, such as the velo...
Chia-Han Lin, Arbee L. P. Chen
COCOON
2011
Springer
12 years 8 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
TALG
2010
123views more  TALG 2010»
13 years 7 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina
APPML
2007
92views more  APPML 2007»
13 years 9 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 3 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...