10988 search results - page 468 / 2198 » Algorithmic Folding Complexity |
194
Voted
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
177
click to vote
COMPGEOM
2009
ACM
16 years 28 days ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
184
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
171
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
168
Voted
CN
1998
15 years 6 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...