Sciweavers

999 search results - page 125 / 200
» Finding shapes in a set of points
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 10 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
BMCBI
2006
118views more  BMCBI 2006»
14 years 9 months ago
Identification of gene expression patterns using planned linear contrasts
Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
Hao Li, Constance L. Wood, Yushu Liu, Thomas V. Ge...
CGF
2011
14 years 1 months ago
Procedural Modeling of Interconnected Structures
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...
Lars Krecklau, Leif Kobbelt
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
15 years 10 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
VLDB
2005
ACM
153views Database» more  VLDB 2005»
15 years 10 months ago
An effective and efficient algorithm for high-dimensional outlier detection
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...
Charu C. Aggarwal, Philip S. Yu