Sciweavers

1051 search results - page 157 / 211
» Fundamental Challenges in Mobile Computing
Sort
View
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 10 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 10 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
CANS
2009
Springer
165views Cryptology» more  CANS 2009»
14 years 4 months ago
Blink 'Em All: Scalable, User-Friendly and Secure Initialization of Wireless Sensor Nodes
Abstract. Wireless sensor networks have several useful applications in commercial and defense settings, as well as user-centric personal area networks. To establish secure (point-t...
Nitesh Saxena, Md. Borhan Uddin
MM
2009
ACM
199views Multimedia» more  MM 2009»
14 years 4 months ago
Signature quadratic form distances for content-based similarity
Determining similarity is a fundamental task in querying multimedia databases in a content-based way. For this challenging task, there exist numerous similarity models which measu...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
MM
2009
ACM
163views Multimedia» more  MM 2009»
14 years 4 months ago
CompositeMap: a novel music similarity measure for personalized multimodal music search
How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems in music information retrieval. This paper ...
Bingjun Zhang, Qiaoliang Xiang, Ye Wang, Jialie Sh...