Sciweavers

2621 search results - page 30 / 525
» Near orders and codes
Sort
View
TOG
2002
107views more  TOG 2002»
13 years 8 months ago
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displ...
Benjamin B. Bederson, Ben Shneiderman, Martin Watt...
ECCC
2010
87views more  ECCC 2010»
13 years 5 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
ICEC
1994
68views more  ICEC 1994»
13 years 9 months ago
Extended Forking Genetic Algorithm for Order Representation (O-FGA)
There are two types of GAs with difference of their representation of strings. They are the binary coded GA and the order-based GA. We've already proposed a new type of binar...
Shigeyoshi Tsutsui, Yoshiji Fujimoto, Isao Hayashi
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 8 months ago
On some invariants in numerical semigroups and estimations of the order bound
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
Anna Oneto, Grazia Tamone
CONEXT
2007
ACM
14 years 13 days ago
Near-optimal co-ordinated coding in wireless multihop networks
The recent work on COPE by Katti et al. demonstrates a practical application of network coding to wireless multihop networks. We note, however, that the opportunistic nature of CO...
Björn Scheuermann, Wenjun Hu, Jon Crowcroft