Sciweavers

870 search results - page 53 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
AAAI
2011
13 years 9 months ago
A Feasible Nonconvex Relaxation Approach to Feature Selection
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Cuixia Gao, Naiyan Wang, Qi Yu, Zhihua Zhang
CCIA
2005
Springer
14 years 11 months ago
Multi-Objective Multicast Routing based on Ant Colony Optimization
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...
Diego Pinto, Benjamín Barán, Ram&oac...
NIPS
2001
14 years 11 months ago
Convolution Kernels for Natural Language
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
Michael Collins, Nigel Duffy
WINET
2010
88views more  WINET 2010»
14 years 8 months ago
Tree-based object tracking without mobility statistics in wireless sensor networks
Object tracking in wireless sensor networks is to track mobile objects by scattered sensors. These sensors are typically organized into a tree to deliver report messages upon dete...
Li-Hsing Yen, Bang Ye Wu, Chia-Cheng Yang
ICCAD
2010
IEEE
141views Hardware» more  ICCAD 2010»
14 years 7 months ago
Local clock skew minimization using blockage-aware mixed tree-mesh clock network
Clock network construction is one key problem in high performance VLSI design. Reducing the clock skew variation is one of the most important objectives during clock network synthe...
Linfu Xiao, Zigang Xiao, Zaichen Qian, Yan Jiang, ...