Sciweavers

1074 search results - page 188 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
ECCC
2010
124views more  ECCC 2010»
14 years 9 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
COCOON
2009
Springer
15 years 4 months ago
On the Performances of Nash Equilibria in Isolation Games
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
Vittorio Bilò, Michele Flammini, Gianpiero ...
SAC
2005
ACM
15 years 3 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
102
Voted
SENSYS
2004
ACM
15 years 3 months ago
Call and response: experiments in sampling the environment
Monitoring of environmental phenomena with embedded networked sensing confronts the challenges of both unpredictable variability in the spatial distribution of phenomena, coupled ...
Maxim A. Batalin, Mohammad H. Rahimi, Yan Yu, Duo ...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 2 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun