Sciweavers

1208 search results - page 27 / 242
» On Counting Generalized Colorings
Sort
View
IJSNET
2006
133views more  IJSNET 2006»
13 years 7 months ago
On the hop count statistics for randomly deployed wireless sensor networks
: In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless ...
Stefan Dulman, Michele Rossi, Paul J. M. Havinga, ...
JCO
2010
97views more  JCO 2010»
13 years 6 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 5 months ago
Counting Plane Graphs: Flippability and its Applications
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...
CHI
2010
ACM
14 years 2 months ago
Individual models of color differentiation to improve interpretability of information visualization
Color is commonly used to represent categories and values in many computer applications, but differentiating these colors can be difficult in many situations (e.g., for users with...
David R. Flatla, Carl Gutwin
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...