Sciweavers

11 search results - page 1 / 3
» Finding Patterns Avoiding Many Monochromatic Constellations
Sort
View
EM
2010
129views Management» more  EM 2010»
12 years 12 months ago
Finding Patterns Avoiding Many Monochromatic Constellations
Given fixed 0 = q0 < q1 < q2 <
Steve Butler, Kevin P. Costello, Ronald L. Graham
TCAD
2008
128views more  TCAD 2008»
13 years 4 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 5 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
DAGSTUHL
2006
13 years 6 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
AUSAI
2005
Springer
13 years 10 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb