Sciweavers

8728 search results - page 381 / 1746
» On Reduct Construction Algorithms
Sort
View
CIDM
2007
IEEE
16 years 1 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...
GLOBECOM
2007
IEEE
16 years 1 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
IPPS
2006
IEEE
16 years 1 months ago
Dynamic power saving in fat-tree interconnection networks using on/off links
Current trends in high-performance parallel computers show that fat-tree interconnection networks are one of the most popular topologies. The particular characteristics of this to...
Marina Alonso, Salvador Coll, Juan Miguel Mart&iac...
188
Voted
ATVA
2005
Springer
111views Hardware» more  ATVA 2005»
16 years 1 months ago
Model Checking Prioritized Timed Automata
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
Shang-Wei Lin, Pao-Ann Hsiung, Chun-Hsian Huang, Y...
ISMIS
2005
Springer
16 years 1 months ago
Scalable Inductive Learning on Partitioned Data
With the rapid advancement of information technology, scalability has become a necessity for learning algorithms to deal with large, real-world data repositories. In this paper, sc...
Qijun Chen, Xindong Wu, Xingquan Zhu