5964 search results - page 231 / 1193 » A theory of speculative computation |
191
click to vote
FOCS
2008
IEEE
16 years 1 months 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...
221
click to vote
ATAL
2006
Springer
15 years 11 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...
170
click to vote
EOR
2007
15 years 7 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 ...
237
click to vote
DKE
2002
15 years 7 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...
192
click to vote
CHI
2010
ACM
16 years 2 months ago
2010
ACM
As our technologies travel to new cultural contexts and our designs and methods engage new constituencies, both our design and analytical practices face significant challenges. We...