Sciweavers

3136 search results - page 314 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
15 years 5 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
TIP
2010
155views more  TIP 2010»
15 years 5 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
TMC
2010
100views more  TMC 2010»
15 years 5 months ago
Optimal Relay Station Placement in Broadband Wireless Access Networks
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...
Bin Lin, Pin-Han Ho, Liang-Liang Xie, Xuemin (Sher...
VC
2010
207views more  VC 2010»
15 years 5 months ago
Protrusion-oriented 3D mesh segmentation
Abstract In this paper, we present a segmentation algorithm which partitions a mesh based on the premise that a 3D object consists of a core body and its constituent protrusible pa...
Alexander Agathos, Ioannis Pratikakis, Stavros J. ...
FDTC
2010
Springer
138views Cryptology» more  FDTC 2010»
15 years 4 months ago
A Continuous Fault Countermeasure for AES Providing a Constant Error Detection Rate
Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. ...
Marcel Medwed, Jörn-Marc Schmidt