Sciweavers

807 search results - page 89 / 162
» Competition Adds Complexity
Sort
View
STVR
2010
80views more  STVR 2010»
14 years 4 months ago
Testing coupling relationships in object-oriented programs
As we move to developing object-oriented programs, the complexity traditionally found in functions and procedures is moving to the connections among components. Different faults o...
Roger T. Alexander, Jeff Offutt, Andreas Stefik
TNN
2010
176views Management» more  TNN 2010»
14 years 4 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
ANOR
2011
117views more  ANOR 2011»
14 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
CVPR
2004
IEEE
15 years 12 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
ACMACE
2009
ACM
15 years 4 months ago
iSee: interactive scenario explorer for online tournament games
Fantasy games, in which players compete to correctly predict realworld outcomes in sports, entertainment, and politics, have grown in popularity and now represent a significant po...
Greg Smith, Desney S. Tan, Bongshin Lee