Sciweavers

IWCIA
2004
Springer
13 years 10 months ago
Convex Hulls in a 3-Dimensional Space
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new ...
Vladimir Kovalevsky, Henrik Schulz
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen
GFKL
2007
Springer
139views Data Mining» more  GFKL 2007»
13 years 11 months ago
The Noise Component in Model-based Cluster Analysis
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
Christian Hennig, Pietro Coretto
SASO
2008
IEEE
13 years 11 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
ICPR
2008
IEEE
13 years 11 months ago
Convex hull based approach for multi-oriented character recognition from graphical documents
In this paper, we present a scheme towards recognition of English character in multi-scale and multi-oriented environments. Graphical document such as map consists of text lines w...
Partha Pratim Roy, Umapada Pal, Josep Lladó...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
13 years 11 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
ICDM
2009
IEEE
126views Data Mining» more  ICDM 2009»
13 years 11 months ago
Convex Non-negative Matrix Factorization in the Wild
Abstract—Non-negative matrix factorization (NMF) has recently received a lot of attention in data mining, information retrieval, and computer vision. It factorizes a non-negative...
Christian Thurau, Kristian Kersting, Christian Bau...
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 5 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
ISBI
2004
IEEE
14 years 5 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
ICIP
2000
IEEE
14 years 6 months ago
Approximately Optimal Assignment for Unequal Loss Protection
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
Alexander E. Mohr, Richard E. Ladner, Eve A. Riski...