5153 search results - page 778 / 1031 » Introduction to Randomized Algorithms |
98
Voted
WDAG
2007
Springer
15 years 9 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
127
Voted
ICPPW
2006
IEEE
15 years 9 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
126
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
112
Voted
ACCV
2006
Springer
15 years 9 months ago
2006
Springer
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing...
116
Voted
DATE
2005
IEEE
15 years 9 months ago
2005
IEEE
The advent of sensor networks presents untapped opportunities for synthesis. We examine the problem of synthesis of behavioral specifications into networks of programmable sensor ...