Sciweavers

430 search results - page 35 / 86
» A New Linearizing Restriction in the Pattern Matching Proble...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Compressed classification of observation sets with linear subspace embeddings
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
Dorina Thanou, Pascal Frossard
AI
2011
Springer
13 years 3 months ago
Expressive markets for donating to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
Vincent Conitzer, Tuomas Sandholm
AAAI
2006
13 years 9 months ago
Automatic Wrapper Generation Using Tree Matching and Partial Tree Alignment
This paper is concerned with the problem of structured data extraction from Web pages. The objective of the research is to automatically segment data records in a page, extract da...
Yanhong Zhai, Bing Liu
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 9 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
SIAMJO
2002
117views more  SIAMJO 2002»
13 years 7 months ago
Analysis of Generalized Pattern Searches
This paper contains a new convergence analysis for the Lewis and Torczon generalized pattern search (GPS) class of methods for unconstrained and linearly constrained optimization. ...
Charles Audet, J. E. Dennis Jr.