Sciweavers

2152 search results - page 173 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
IDEAL
2003
Springer
15 years 10 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
ICC
2007
IEEE
113views Communications» more  ICC 2007»
15 years 11 months ago
Complexity and Error Propagation of Localization Using Interferometric Ranging
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
Rui Huang, Gergely V. Záruba, Manfred Huber
BTW
2001
Springer
98views Database» more  BTW 2001»
15 years 9 months ago
On Parallel Join Processing in Object-Relational Database Systems
Abstract. So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-base...
Holger Märtens, Erhard Rahm
151
Voted
ECP
1997
Springer
125views Robotics» more  ECP 1997»
15 years 9 months ago
Possibilistic Planning: Representation and Complexity
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
Célia da Costa Pereira, Frédé...
156
Voted
TABLEAUX
1997
Springer
15 years 9 months ago
Tableau Methods for PA-Processes
Abstract. PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-proc...
Richard Mayr