2996 search results - page 200 / 600 » Numberings and Randomness |
187
click to vote
WDAG
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
158
click to vote
GRID
2004
Springer
15 years 12 months ago
2004
Springer
We introduce a formal model for deployment and hosting of a dynamic grid service wherein the service provider must pay a resource provider for the use of computational resources. ...
200
click to vote
SSPR
2004
Springer
15 years 12 months ago
2004
Springer
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
158
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
A deterministic dynamic element matching (DEM) approach to ADC testing is introduced and compared with a common random DEM method. With both approaches, a highly non-ideal DAC is ...
139
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...