Sciweavers

11740 search results - page 26 / 2348
» More Problems in Rewriting
Sort
View
CADE
2010
Springer
13 years 9 months ago
Decreasing Diagrams and Relative Termination
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
Nao Hirokawa, Aart Middeldorp
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
14 years 2 months ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...
Bram De Wachter, Alexandre Genon, Thierry Massart
IJPRAI
2006
114views more  IJPRAI 2006»
13 years 8 months ago
Selective Voting - Getting More for Less in Sensor Fusion
Many real life problems are characterized by the structure of data derived from multiple sensors. The sensors may be independent, yet their information considers the same entities...
Lior Rokach, Oded Maimon, Reuven Arbel
JCNS
2010
103views more  JCNS 2010»
13 years 3 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 10 months ago
Multiple Materialized View Selection for XPath Query Rewriting
We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using ...
Byron Choi, Jeffrey Xu Yu, Kam-Fai Wong, M. Tamer ...