Sciweavers

5214 search results - page 141 / 1043
» The Online Specialization Problem
Sort
View
138
Voted
ICML
2010
IEEE
15 years 5 months ago
Online Streaming Feature Selection
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
Xindong Wu, Kui Yu, Hao Wang, Wei Ding
JWSR
2007
99views more  JWSR 2007»
15 years 3 months ago
A Metamorphic Testing Approach for Online Testing of Service-Oriented Software Applications
: Testing the correctness of services assures the functional quality of service-oriented application. A service-oriented application may bind dynamically to its supportive services...
W. Chan, S. Cheung, K. Leung
CHI
2011
ACM
14 years 7 months ago
Competing online viewpoints and models of chronic illness
People with chronic health problems use online resources to understand and manage their condition, but many such resources can present competing and confusing viewpoints. We surve...
Jennifer Mankoff, Kateryna Kuksenok, Sara B. Kiesl...
ESA
2003
Springer
77views Algorithms» more  ESA 2003»
15 years 9 months ago
An Optimal Algorithm for the Maximum-Density Segment Problem
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
Kai-min Chung, Hsueh-I Lu
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
14 years 11 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic