Sciweavers

306 search results - page 60 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
SEMWEB
2010
Springer
13 years 5 months ago
Supporting Natural Language Processing with Background Knowledge: Coreference Resolution Case
Systems based on statistical and machine learning methods have been shown to be extremely effective and scalable for the analysis of large amount of textual data. However, in the r...
Volha Bryl, Claudio Giuliano, Luciano Serafini, Ka...
CVPR
2007
IEEE
14 years 9 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 7 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
IWANN
2009
Springer
13 years 12 months ago
Easing the Smart Home: Translating Human Hierarchies to Intelligent Environments
Abstract. Ubiquitous computing research have extended traditional environments in the so–called Intelligent Environments. All of them use their capabilities for pursuing their in...
Manuel García-Herranz, Pablo A. Haya, Xavie...
CIKM
2007
Springer
13 years 11 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang