185 search results - page 30 / 37 » Constructions of Grassmannian Simplices |
123
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
As the size of data storing arrays of disks grows, it becomes vital to protect data against double disk failures. An economic way of providing such protection consists of adding tw...
EXPERT
2002
14 years 10 months ago
2002
names in the same abstract already indicates a relation between them. Because of its simplicity, we can apply this approach to large amounts of text and establish interaction netwo...
115
Voted
IPSN
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
115
click to vote
OOPSLA
2007
Springer
15 years 4 months ago
2007
Springer
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...