19320 search results - page 298 / 3864 » On the complexity of computing determinants |
172
click to vote
RSA
2006
15 years 6 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
266
click to vote
FSKD
2007
Springer
16 years 26 days ago
2007
Springer
One of the Web information Retrieval (IR) problems these days is to identify redundant information that exist in (replicated) Web documents. These documents can easily be found in...
200
click to vote
AMET
1998
Springer
15 years 11 months ago
1998
Springer
Automated negotiation has been of particular interest due to the relevant role that negotiation plays among trading agents. This paper presents two types of agent architecture: Cas...
165
Voted
PAMI
2002
15 years 6 months ago
2002
We advance new active object recognition algorithms that classify rigid objects and estimate their pose from intensity images. Our algorithms automatically detect if the class or p...
169
click to vote
STACS
2005
Springer
16 years 5 days ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...