Sciweavers

4761 search results - page 296 / 953
» Generalizing Boundary Points
Sort
View
148
Voted
ISAAC
2001
Springer
123views Algorithms» more  ISAAC 2001»
15 years 10 months ago
Labeling Subway Lines
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
Maria Angeles Garrido, Claudia Iturriaga, Alberto ...
AOSD
2007
ACM
15 years 10 months ago
Improve pointcut definitions with program views
Aspect-oriented programming languages select join points using pointcut constructs that depend on the syntactic structure of the base program. As the base program evolves, the poi...
Zifu Yang, Tian Zhao
COMPGEOM
1995
ACM
15 years 9 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein
163
Voted
DATAMINE
2006
166views more  DATAMINE 2006»
15 years 6 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 5 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri