8512 search results - page 260 / 1703 » Computing Theory With Relevance |
355
Voted
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
147
click to vote
FOCS
2008
IEEE
16 years 18 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
169
Voted
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Conventional information fusion architectures are challenged by developments in sensor networks that allow individually-owned (and thereby selfish) sensors to interact and share d...
148
click to vote
EOR
2007
15 years 6 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
193
click to vote
DKE
2002
15 years 6 months ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...