Sciweavers

1092 search results - page 133 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
172
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
MOBIHOC
2008
ACM
16 years 5 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICPADS
2007
IEEE
16 years 17 days ago
Energy-efficient anonymous multicast in mobile ad-hoc networks
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...
Jung-Chun Kao, Radu Marculescu
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
16 years 13 days ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
LWA
2008
15 years 7 months ago
Pre analysis and clustering of uncertain data from manufacturing processes
With increasing complexity of manufacturing processes, the volume of data that has to be evaluated rises accordingly. The complexity and data volume make any kind of manual data a...
Peter Benjamin Volk, Martin Hahmann, Dirk Habich, ...