Sciweavers

4850 search results - page 590 / 970
» Approximate Data Structures with Applications
Sort
View
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 7 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
CAISE
2005
Springer
16 years 12 days ago
BInXS: A Process for Integration of XML Schemata
This paper presents a detailed integration process for XML schemata called BInXS. BInXS adopts a global-as-view integration approach that builds a global schema from a set of heter...
Ronaldo dos Santos Mello, Carlos A. Heuser
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
16 years 10 days ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
15 years 11 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
WSDM
2012
ACM
245views Data Mining» more  WSDM 2012»
14 years 2 months ago
The early bird gets the buzz: detecting anomalies and emerging trends in information networks
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
Brian Thompson