Sciweavers

2593 search results - page 348 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
IPPS
2008
IEEE
14 years 4 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 2 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
ISCI
2008
116views more  ISCI 2008»
13 years 10 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
WIOPT
2011
IEEE
13 years 1 months ago
Broadcasting with a battery limited energy harvesting rechargeable transmitter
—We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in a two-user AWGN broadcast channel. The transmitter has ï...
Omur Ozel, Jing Yang, Sennur Ulukus
HAPTICS
2006
IEEE
14 years 4 months ago
Perceptual Analysis of Haptic Icons: an Investigation into the Validity of Cluster Sorted MDS
The design of usable haptic icons (brief informational signals delivered through the sense of touch) requires a tool for measuring perceptual distances between icons that will be ...
Jérôme Pasquero, Joseph Luk, Shannon ...