Sciweavers

1420 search results - page 168 / 284
» Representation of Graphs by OBDDs
Sort
View
AAAI
2006
15 years 8 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
EMNLP
2006
15 years 8 months ago
Learning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
Michael L. Wick, Aron Culotta, Andrew McCallum
BIODATAMINING
2008
119views more  BIODATAMINING 2008»
15 years 6 months ago
A survey of visualization tools for biological network analysis
The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount ...
Georgios A. Pavlopoulos, Anna-Lynn Wegener, Reinha...
JUCS
2006
87views more  JUCS 2006»
15 years 6 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
KES
2006
Springer
15 years 6 months ago
Genetic-Fuzzy Modeling on High Dimensional Spaces
In this paper, in order to reduce the explosive increase of the search space as the input dimension grows, we present a new representation method for the structure of fuzzy rules, ...
Joon-Min Gil, SeongHoon Lee