3134 search results - page 197 / 627 » Computing full disjunctions |
106
Voted
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
123
Voted
ICWS
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper proposes a model-based technique for lowering the entrance barrier for service providers to register services with a marketplace broker, such that the service is rapidl...
171
click to vote
Publication
We present a simple, effective generalisation of variable order Markov
models to full online Bayesian estimation. The mechanism used is close
to that employed in context tree wei...
138
Voted
ICCD
2004
IEEE
16 years 26 days ago
2004
IEEE
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
138
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...