Sciweavers

9871 search results - page 32 / 1975
» On the Structure of Low Sets
Sort
View
ECML
2007
Springer
14 years 1 months ago
Optimizing Feature Sets for Structured Data
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
Ulrich Rückert, Stefan Kramer
GLOBECOM
2007
IEEE
14 years 2 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
13 years 7 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
APAL
2004
132views more  APAL 2004»
13 years 7 months ago
Canonical structure in the universe of set theory: part one
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...
James Cummings, Matthew Foreman, Menachem Magidor