Sciweavers

530 search results - page 102 / 106
» The resource pooling principle
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 3 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
15 years 3 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp
86
Voted
ASAP
2007
IEEE
112views Hardware» more  ASAP 2007»
15 years 1 months ago
Scheduling Register-Allocated Codes in User-Guided High-Level Synthesis
In high-level synthesis, as for compilers, an important question is when register assignment should take place. Unlike compilers for which the processor architecture is given, syn...
Alain Darte, C. Quinson
98
Voted
SERVICES
2008
103views more  SERVICES 2008»
15 years 1 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...
110
Voted
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 1 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...