Sciweavers

767 search results - page 66 / 154
» On Clustering Using Random Walks
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
JSS
2010
198views more  JSS 2010»
13 years 3 months ago
Accelerated collection of sensor data by mobility-enabled topology ranks
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Mot...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
AIIA
2009
Springer
14 years 3 months ago
Partitioning Search Spaces of a Randomized Search
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
CVPR
2004
IEEE
14 years 11 months ago
Shape Representation and Classification Using the Poisson Equation
Silhouettes contain rich information about the shape of objects that can be used for recognition and classification. We present a novel approach that allows us to reliably compute...
Lena Gorelick, Meirav Galun, Eitan Sharon, Ronen B...
DBISP2P
2004
Springer
70views Database» more  DBISP2P 2004»
14 years 2 months ago
Using Information Retrieval Techniques to Route Queries in an InfoBeacons Network
We present the InfoBeacons system, in which a peer-to-peer network of beacons cooperates to route queries to the best information sources. The routing in our system uses techniques...
Brian F. Cooper