Sciweavers

10792 search results - page 372 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
ICDCN
2011
Springer
14 years 10 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
AAAI
2011
14 years 6 months ago
Exploiting Problem Symmetries in State-Based Planners
Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance t...
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein
CORR
2012
Springer
209views Education» more  CORR 2012»
14 years 2 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
IROS
2008
IEEE
131views Robotics» more  IROS 2008»
16 years 1 months ago
Laser based intersection detection for reactive navigation in an underground mine
— In this paper we propose a new feature detection algorithm to enable junction recognition intended for high speed reactive navigation in tunnel like environments. We also prese...
Johan Larsson, Mathias Broxvall, Alessandro Saffio...
NAACL
2001
15 years 8 months ago
Knowledge-Free Induction of Inflectional Morphologies
We propose an algorithm to automatically induce the morphology of inflectional languages using only text corpora and no human input. Our algorithm combines cues from orthography, ...
Patrick Schone, Daniel Jurafsky