Sciweavers

4377 search results - page 562 / 876
» Mass problems and randomness
Sort
View
JMLR
2012
13 years 9 months ago
Wilks' phenomenon and penalized likelihood-ratio test for nonparametric curve registration
The problem of curve registration appears in many different areas of applications ranging from neuroscience to road traffic modeling. In the present work, we propose a nonparamet...
Arnak S. Dalalyan, Olivier Collier
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 9 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
PODC
2009
ACM
16 years 7 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
16 years 1 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
220
Voted
KSEM
2009
Springer
16 years 1 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer