Sciweavers

1859 search results - page 331 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
128
Voted
SIGCSE
2006
ACM
146views Education» more  SIGCSE 2006»
15 years 8 months ago
Introductory game creation: no programming required
Many incoming college freshmen have accumulated a significant number of hours of experience playing computer games. Extending that experience to actual game creation activities ca...
A. T. Chamillard
129
Voted
INFORMS
1998
100views more  INFORMS 1998»
15 years 2 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
JCDL
2004
ACM
128views Education» more  JCDL 2004»
15 years 8 months ago
Panorama: extending digital libraries with topical crawlers
A large amount of research, technical and professional documents are available today in digital formats. Digital libraries are created to facilitate search and retrieval of inform...
Gautam Pant, Kostas Tsioutsiouliklis, Judy Johnson...
268
Voted
ECCV
2004
Springer
16 years 4 months ago
A Boosted Particle Filter: Multitarget Detection and Tracking
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...
Kenji Okuma, Ali Taleghani, Nando de Freitas, Jame...
119
Voted
ICML
1998
IEEE
16 years 3 months ago
Feature Selection via Concave Minimization and Support Vector Machines
Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space ...
Paul S. Bradley, Olvi L. Mangasarian