2661 search results - page 183 / 533 » Quantum Complexity Classes |
133
click to vote
IPSN
2005
Springer
15 years 9 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
150
click to vote
WINE
2005
Springer
15 years 9 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
110
Voted
WIA
2004
Springer
15 years 9 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
139
Voted
FCS
2006
15 years 5 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
125
Voted
PRL
2008
15 years 3 months ago
2008
In this paper, we propose spam e-mail filtering methods having high accuracies and low time complexities. The methods are based on the n-gram approach and a heuristics which is re...