Sciweavers

1007 search results - page 71 / 202
» The Complexity of Futile Questioning
Sort
View
111
Voted
HICSS
2005
IEEE
138views Biometrics» more  HICSS 2005»
15 years 9 months ago
A Method to Redesign the IS Portfolios in Large Organisations
Over the past decades, large organisations have developed increasingly complex portfolios of information systems to support business processes. Maintenance and leveraging of these...
Remco Groot, Martin Smits, Halbe Kuipers
ANTS
2006
Springer
127views Algorithms» more  ANTS 2006»
15 years 7 months ago
Doubly-Focused Enumeration of Pseudosquares and Pseudocubes
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
Kjell Wooding, Hugh C. Williams
135
Voted
ICALP
2010
Springer
15 years 5 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
142
Voted
NN
2007
Springer
15 years 10 months ago
Impact of Higher-Order Correlations on Coincidence Distributions of Massively Parallel Data
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
Sonja Grün, Moshe Abeles, Markus Diesmann
139
Voted
STACS
2005
Springer
15 years 9 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning