Sciweavers

8413 search results - page 307 / 1683
» Ordering Problem Subgoals
Sort
View
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 9 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
ICPR
2006
IEEE
16 years 7 months ago
A Maximum-Likelihood Approach to Symbolic Indirect Correlation
Symbolic Indirect Correlation (SIC) is a nonparametric method that offers significant advantages for recognition of ordered unsegmented signals. A previously introduced formulatio...
Ashutosh Joshi, Daniel P. Lopresti, George Nagy, S...
WETICE
2009
IEEE
16 years 1 months ago
A Game Theoretical Approach in Securing P2P Storage against Whitewashers
—An inherent problem to a cooperation incentive mechanism implemented into a dynamic system where peers may join or leave at any time is the whitewashing problem. Whitewashers ar...
Nouha Oualha, Yves Roudier
GRC
2007
IEEE
16 years 27 days ago
Structured Writing with Granular Computing Strategies
— Granular computing unifies structured thinking, structured problem solving and structured information processing. In order to see the flexibility and universal applicability ...
Yiyu Yao
RTSS
2007
IEEE
16 years 25 days ago
The Design of an EDF-Scheduled Resource-Sharing Open Environment
We study the problem of executing a collection of independently designed and validated task systems upon a common comprised of a preemptive processor and additional shared resourc...
Nathan Fisher, Marko Bertogna, Sanjoy K. Baruah