Sciweavers

325 search results - page 28 / 65
» Alternatives to two classic data structures
Sort
View
COMPGEOM
2009
ACM
15 years 4 months ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...
ICDCS
2005
IEEE
15 years 3 months ago
DSI: A Fully Distributed Spatial Index for Location-Based Wireless Broadcast Services
Recent announcement of the MSN Direct Service has demonstrated the feasibility and industrial interest in utilizing wireless broadcast for pervasive information services. To suppo...
Wang-Chien Lee, Baihua Zheng
71
Voted
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 4 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy
IDEAL
2004
Springer
15 years 3 months ago
Combining Local and Global Models to Capture Fast and Slow Dynamics in Time Series Data
Many time series exhibit dynamics over vastly different time scales. The standard way to capture this behavior is to assume that the slow dynamics are a “trend”, to de-trend t...
Michael Small
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...