Sciweavers

2542 search results - page 340 / 509
» An Operational Definition of Context
Sort
View
PAMI
2006
164views more  PAMI 2006»
15 years 6 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
PERVASIVE
2006
Springer
15 years 6 months ago
Using a Live-In Laboratory for Ubiquitous Computing Research
Abstract. Ubiquitous computing researchers are increasingly turning to sensorenabled "living laboratories" for the study of people and technologies in settings more natur...
Stephen S. Intille, Kent Larson, Emmanuel Munguia ...
SIGOPS
2008
104views more  SIGOPS 2008»
15 years 6 months ago
PipesFS: fast Linux I/O in the unix tradition
This paper presents PipesFS, an I/O architecture for Linux 2.6 that increases I/O throughput and adds support for heterogeneous parallel processors by (1) collapsing many I/O inte...
Willem de Bruijn, Herbert Bos
ISCI
2007
170views more  ISCI 2007»
15 years 6 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
TFS
2008
131views more  TFS 2008»
15 years 6 months ago
A Fuzzy Qualitative Framework for Connecting Robot Qualitative and Quantitative Representations
Abstract-- This paper proposes a novel framework for describing articulated robot kinematics motion with the goal of providing a unified representation by combining symbolic or qua...
Honghai Liu