Sciweavers

4850 search results - page 513 / 970
» Approximate Data Structures with Applications
Sort
View
225
Voted
ICDM
2010
IEEE
217views Data Mining» more  ICDM 2010»
15 years 5 months ago
iSAX 2.0: Indexing and Mining One Billion Time Series
There is an increasingly pressing need, by several applications in diverse domains, for developing techniques able to index and mine very large collections of time series. Examples...
Alessandro Camerra, Themis Palpanas, Jin Shieh, Ea...
INFOCOM
2010
IEEE
15 years 5 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...
193
Voted
HT
1998
ACM
15 years 11 months ago
XHMBS: A Formal Model to Support Hypermedia Specification
This paper introduces XHMBS (the eXtended Hyperdocument Model Based on Statecharts) to support the formal specification of general hypermedia applications. XHMBS uses a novel form...
Fabiano Borges Paulo, Marcelo Augusto Santos Turin...
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
16 years 1 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
247
Voted
CVPR
2012
IEEE
13 years 9 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee