Sciweavers

447 search results - page 63 / 90
» Re-ranking search results using document-passage graphs
Sort
View
CICLING
2003
Springer
15 years 2 months ago
Per-node Optimization of Finite-State Mechanisms for Natural Language Processing
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
Alexander Troussov, Brian O'Donovan, Seppo Koskenn...
BMCBI
2006
178views more  BMCBI 2006»
14 years 9 months ago
GOLEM: an interactive graph-based gene-ontology navigation and analysis tool
Background: The Gene Ontology has become an extremely useful tool for the analysis of genomic data and structuring of biological knowledge. Several excellent software tools for na...
Rachel S. G. Sealfon, Matthew A. Hibbs, Curtis Hut...
AI
2008
Springer
14 years 9 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
ICPADS
2005
IEEE
15 years 3 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
58
Voted
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 3 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon