Sciweavers

362 search results - page 15 / 73
» Discovering Interesting Holes in Data
Sort
View
JCB
2007
118views more  JCB 2007»
14 years 10 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
SSD
2001
Springer
128views Database» more  SSD 2001»
15 years 2 months ago
Creating Representations for Continuously Moving Regions from Observations
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
Erlend Tøssebro, Ralf Hartmut Güting
IANDC
2008
141views more  IANDC 2008»
14 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
JMLR
2012
13 years 17 days ago
Minimax rates for homology inference
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sh...
ICDM
2003
IEEE
114views Data Mining» more  ICDM 2003»
15 years 3 months ago
Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis
A significant portion of knowledge discovery and data mining research focuses on finding patterns of interest in data. Once a pattern is found, it can be used to recognize satisfy...
Shou-de Lin, Hans Chalupsky