Sciweavers

12536 search results - page 12 / 2508
» Cardinality Networks and Their Applications
Sort
View
ICDE
2012
IEEE
216views Database» more  ICDE 2012»
11 years 10 months ago
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
—MapReduce has emerged as a popular tool for distributed and scalable processing of massive data sets and is increasingly being used in e-science applications. Unfortunately, the...
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser...
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 7 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
12 years 10 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
OL
2011
242views Neural Networks» more  OL 2011»
13 years 2 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 7 months ago
On the size of identifying codes in triangle-free graphs
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
Florent Foucaud, Ralf Klasing, Adrian Kosowski, An...