Sciweavers

1172 search results - page 55 / 235
» Constructions of generalized Sidon sets
Sort
View
ICML
2006
IEEE
16 years 20 days ago
Online multiclass learning by interclass hypothesis sharing
We describe a general framework for online multiclass learning based on the notion of hypothesis sharing. In our framework sets of classes are associated with hypotheses. Thus, al...
Michael Fink 0002, Shai Shalev-Shwartz, Yoram Sing...
TSP
2011
106views more  TSP 2011»
14 years 6 months ago
Distributed Estimation and Coding: A Sequential Framework Based on a Side-Informed Decomposition
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
Chao Yu, Gaurav Sharma
GIS
2007
ACM
16 years 28 days ago
TerraStream: from elevation data to watershed hierarchies
We consider the problem of extracting a river network and a watershed hierarchy from a terrain given as a set of irregularly spaced points. We describe TerraStream, a "pipeli...
Andrew Danner, Thomas Mølhave, Ke Yi, Panka...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 5 days ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
FSTTCS
2004
Springer
15 years 5 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer