Sciweavers

144 search results - page 28 / 29
» Solving Regular Tree Grammar Based Constraints
Sort
View
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 7 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
SOFSEM
2000
Springer
13 years 9 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
CIC
2004
118views Communications» more  CIC 2004»
13 years 7 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
WACV
2005
IEEE
13 years 11 months ago
Image Segmentation by Unsupervised Sparse Clustering
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
Byoung-Ki Jeon, Yun-Beom Jung, Ki-Sang Hong
TPDS
2008
96views more  TPDS 2008»
13 years 5 months ago
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack