501 search results - page 55 / 101 » Rough Sets and Approximation Schemes |
108
Voted
MST
2006
15 years 20 days ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
99
Voted
OSDI
1996
ACM
15 years 2 months ago
1996
ACM
Current operating systems offer poor performance when a numeric application's working set does not fit in main memory. As a result, programmers who wish to solve "out-of...
119
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
103
click to vote
RTSS
2000
IEEE
15 years 5 months ago
2000
IEEE
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...