2600 search results - page 513 / 520 » Clustering with or without the Approximation |
116
click to vote
QUESTA
2010
14 years 11 months ago
2010
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
126
click to vote
TKDE
2010
14 years 11 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
113
click to vote
TKDE
2010
14 years 11 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
TMC
2010
14 years 11 months ago
2010
—There are many situations in which an additional network interface—or two—can provide benefits to a mobile user. Additional interfaces can support parallelism in network flo...
115
click to vote
TMC
2010
14 years 11 months ago
2010
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...