Sciweavers

276 search results - page 20 / 56
» Frequent Submap Discovery
Sort
View
DIS
2007
Springer
14 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
ECAI
2006
Springer
14 years 1 months ago
Learning by Automatic Option Discovery from Conditionally Terminating Sequences
Abstract. This paper proposes a novel approach to discover options in the form of conditionally terminating sequences, and shows how they can be integrated into reinforcement learn...
Sertan Girgin, Faruk Polat, Reda Alhajj
PAKDD
2005
ACM
132views Data Mining» more  PAKDD 2005»
14 years 3 months ago
On Multiple Query Optimization in Data Mining
Traditional multiple query optimization methods focus on identifying common subexpressions in sets of relational queries and on constructing their global execution plans. In this p...
Marek Wojciechowski, Maciej Zakrzewicz
ICC
2008
IEEE
122views Communications» more  ICC 2008»
14 years 4 months ago
Improving Quality of Experience by Adding Device Resource Reservation to Service Discovery Protocols
— Current service discovery protocols (SDP) hardly provide information on the actual availability of resources in the network or a mechanism for (device) resource reservation. Wh...
Archi Delphinanto, A. M. J. Koonen, Frank T. H. de...
ICDCS
2009
IEEE
14 years 6 months ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu