Sciweavers

78 search results - page 7 / 16
» Large Equiangular Sets of Lines in Euclidean Space
Sort
View
81
Voted
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
15 years 5 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
KDD
2008
ACM
234views Data Mining» more  KDD 2008»
16 years 2 days ago
Angle-based outlier detection in high-dimensional data
Detecting outliers in a large set of data objects is a major data mining task aiming at finding different mechanisms responsible for different groups of objects in a data set. All...
Hans-Peter Kriegel, Matthias Schubert, Arthur Zime...
114
Voted
LPAR
2005
Springer
15 years 5 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
128
Voted
FOCS
2010
IEEE
14 years 9 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
75
Voted
AVI
2008
15 years 2 months ago
Visualizing antenna design spaces
This paper describes a long-term project exploring advanced visual interfaces for antenna design. MERL developed three successive prototypes that embodied an evolution towards lar...
Kent Wittenburg, Tom Lanning, Darren Leigh, Kathy ...