1331 search results - page 264 / 267 » Complexity bounds for zero-test algorithms |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...