Sciweavers

903 search results - page 168 / 181
» Completeness Results for Memory Logics
Sort
View
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
16 years 6 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
WWW
2010
ACM
16 years 1 months ago
A client-server architecture for state-dependent dynamic visualizations on the web
As sophisticated enterprise applications move to the Web, some advanced user experiences become difficult to migrate due to prohibitively high computation, memory, and bandwidth r...
Daniel Coffman, Danny Soroker, Chandra Narayanaswa...
HIPEAC
2009
Springer
16 years 28 days ago
Hybrid Super/Subthreshold Design of a Low Power Scalable-Throughput FFT Architecture
In this article, we present a parallel implementation of a 1024 point Fast Fourier Transform (FFT) operating with a subthreshold supply voltage, which is below the voltage that tur...
Michael B. Henry, Leyla Nazhandali
INFOCOM
2009
IEEE
16 years 24 days ago
Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
Mohammad Behdadfar, Hossein Saidi, Hamid Alaei, Ba...