603 search results - page 89 / 121 » A General Approximation Technique for Constrained Forest Pro... |
126
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...
ASPLOS
2004
ACM
15 years 5 months ago
2004
ACM
Multiple Clock Domain (MCD) processors are a promising future alternative to today’s fully synchronous designs. Dynamic Voltage and Frequency Scaling (DVFS) in an MCD processor ...
COR
2008
14 years 12 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
107
click to vote
MOBIHOC
2010
ACM
14 years 9 months ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
109
click to vote
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...