Sciweavers

2542 search results - page 302 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
JMLR
2008
117views more  JMLR 2008»
15 years 3 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
TCSV
2010
14 years 10 months ago
M-Channel Multiple Description Coding With Two-Rate Coding and Staggered Quantization
A low complexity M-channel multiple description coding scheme is developed in this paper, in which each description carries one subset of the input with a higher bit rate and the r...
Upul Samarawickrama, Jie Liang, Chao Tian
CVPR
2011
IEEE
14 years 7 months ago
Earth Mover’s Prototypes: a Convex Learning Approach for Discovering Activity Patterns in Dynamic Scenes
We present a novel approach for automatically discovering spatio-temporal patterns in complex dynamic scenes. Similarly to recent non-object centric methods, we use low level visu...
Elisa Ricci, Gloria Zen
ICALP
2009
Springer
16 years 3 months ago
External Sampling
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
152
Voted
EVOW
2010
Springer
15 years 10 months ago
Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions
DEODHAR, SUSHAMNA DEODHAR. Using Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions in Genetic Epidemiology. (Under the direction of Dr. Alison Motsinger-Re...
Sushamna Deodhar, Alison A. Motsinger-Reif