Sciweavers

3220 search results - page 283 / 644
» Constrained Graph Processes
Sort
View
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
JOT
2010
126views more  JOT 2010»
15 years 5 months ago
Inferring design patterns using the ReP graph
Abstract Periodic refactoring of a large source code often becomes a necessity especially for long-lived projects. In order to increase maintainability and extensibility of such pr...
Tushar Sharma, Dharanipragada Janakiram
PAMI
2010
133views more  PAMI 2010»
15 years 5 months ago
An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language pr...
Roberto Navigli, Mirella Lapata
ICDAR
2009
IEEE
15 years 4 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
PRL
2011
14 years 9 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...