Sciweavers

5022 search results - page 140 / 1005
» Data structures and problem solving using Java
Sort
View
EMNLP
2011
13 years 9 months ago
Heuristic Search for Non-Bottom-Up Tree Structure Prediction
State of the art Tree Structures Prediction techniques rely on bottom-up decoding. These approaches allow the use of context-free features and bottom-up features. We discuss the l...
Andrea Gesmundo, James Henderson
CSB
2005
IEEE
142views Bioinformatics» more  CSB 2005»
15 years 3 months ago
BioMap: Discovering Schema Mapping Using Ontologies
Biologists currently devote significant time and effort searching information for their research. The wide diversity in terminology used inhibit effective computerized and manual...
Zoé Lacroix, Sumedha Gholba, Hervé M...
ECAI
2004
Springer
15 years 3 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...
AMFG
2005
IEEE
211views Biometrics» more  AMFG 2005»
14 years 12 months ago
Non-rigid Face Modelling Using Shape Priors
Non-rigid 3D shape recovery is an inherently ambiguous problem. Given a specific rigid motion, different non-rigid shapes can be found that fit the measurements. To solve this am...
Alessio Del Bue, Xavier Lladó, Lourdes de A...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...