9842 search results - page 341 / 1969 » The Complexity of the Matching-Cut Problem |
151
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
126
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
116
Voted
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper describes critical factors for co-ordinated enterprise and IS/IT development and change in complex organizations in Sweden. These factors represent an answer on the cru...
134
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
148
click to vote
CIKM
1994
Springer
15 years 8 months ago
1994
Springer
Human Genome Project databases present a confluence of interesting database challenges: rapid schema and data evolution, complex data entry and constraint management, and the need...