Sciweavers

2340 search results - page 357 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 11 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
CVPR
2004
IEEE
16 years 8 months ago
Collaborative Tracking of Multiple Targets
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
Ting Yu, Ying Wu
RECOMB
2005
Springer
16 years 6 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
16 years 1 months ago
Rule Ensembles for Multi-target Regression
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
Timo Aho, Bernard Zenko, Saso Dzeroski
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 10 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...