Sciweavers

2969 search results - page 165 / 594
» A space efficient algorithm for group structure computation
Sort
View
153
Voted
HICSS
2005
IEEE
164views Biometrics» more  HICSS 2005»
15 years 9 months ago
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications
Association rule mining in real-time is of increasing thrust in many business applications. Applications such as e-commerce, recommender systems, supply-chain management and group...
Rajanish Dass, Ambuj Mahanti
148
Voted
FCT
2009
Springer
15 years 7 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
132
Voted
CIKM
2008
Springer
15 years 5 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
158
Voted
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
15 years 1 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 3 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...