1368 search results - page 88 / 274 » Perfect Local Computability and Computable Simulations |
143
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
149
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Computationally complex and data intensive atomic scale biomolecular simulation is enabled via Processing in Network Storage (PINS): a novel distributed system framework to overco...
111
Voted
CIE
2007
Springer
15 years 7 months ago
2007
Springer
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
122
Voted
SENSYS
2010
ACM
15 years 1 months ago
2010
ACM
Localization is a fundamental issue of wireless sensor networks that has been extensively studied in the literature. The real-world experience from GreenOrbs, a sensor network sys...
112
Voted
AAAI
2008
15 years 5 months ago
2008
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...