Sciweavers

9842 search results - page 1739 / 1969
» Problem complexity
Sort
View
JDCTA
2010
130views more  JDCTA 2010»
15 years 1 months ago
A Search Algorithm for Clusters in a Network or Graph
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
Dongming Chen, Jing Wang, Xiaodong Chen, Xiaowei X...
JDCTA
2010
150views more  JDCTA 2010»
15 years 1 months ago
Proof as Composition: An approach for the Large-granularity Web Services Composition
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...
Yuyu Yin, Ying Li, Jianwei Yin, ShuiGuang Deng
JMLR
2010
145views more  JMLR 2010»
15 years 1 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
MOBILIGHT
2010
15 years 1 months ago
Stealthy Compromise of Wireless Sensor Nodes with Power Analysis Attacks
Node capture is considered as one of the most critical issues in the security of wireless sensor networks. A popular approach to thwart the problem relies on the detection of event...
Giacomo de Meulenaer, François-Xavier Stand...
PAMI
2010
241views more  PAMI 2010»
15 years 1 months ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song
« Prev « First page 1739 / 1969 Last » Next »