Sciweavers

3946 search results - page 654 / 790
» The computational complexity of choice sets
Sort
View
ADC
2008
Springer
156views Database» more  ADC 2008»
16 years 26 days ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
CGO
2007
IEEE
16 years 26 days ago
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
Louis-Noël Pouchet, Cédric Bastoul, Al...
CISS
2007
IEEE
16 years 26 days ago
A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks
— In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Oc...
Athina P. Petropulu, Lun Dong, H. Vincent Poor
EDOC
2007
IEEE
16 years 26 days ago
Providing Support for Model Composition in Metamodels
In aspect-oriented modeling (AOM), a design is described using a set of design views. It is sometimes necessary to compose the views to obtain an integrated view that can be analy...
Robert B. France, Franck Fleurey, Raghu Reddy, Ben...
ICDM
2007
IEEE
137views Data Mining» more  ICDM 2007»
16 years 25 days ago
Locally Constrained Support Vector Clustering
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
Dragomir Yankov, Eamonn J. Keogh, Kin Fai Kan