Sciweavers

1143 search results - page 106 / 229
» pairing 2007
Sort
View
AROBOTS
2002
100views more  AROBOTS 2002»
15 years 3 months ago
The Demeter System for Automated Harvesting
Automation of agricultural harvesting equipment in the near term appears both economically viable and technically feasible. This paper describes the Demeter system for automated h...
Thomas Pilarski, Michael Happold, Henning Pangels,...
131
Voted
BIBM
2007
IEEE
104views Bioinformatics» more  BIBM 2007»
15 years 7 months ago
A Protocol to Detect Local Affinities Involved in Proteins Distant Interactions
The tridimensional structure of a protein is constrained or stabilized by some local interactions between distant residues of the protein, such as disulfide bonds, electrostatic i...
Christophe Nicolas Magnan, Cécile Capponi, ...
160
Voted
AAAI
2007
15 years 5 months ago
Relation Extraction from Wikipedia Using Subtree Mining
The exponential growth and reliability of Wikipedia have made it a promising data source for intelligent systems. The first challenge of Wikipedia is to make the encyclopedia mac...
Dat P. T. Nguyen, Yutaka Matsuo, Mitsuru Ishizuka
134
Voted
CCIA
2007
Springer
15 years 9 months ago
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
Martí Sánchez, Simon de Givry, Thoma...
GD
2007
Springer
15 years 9 months ago
A Bipartite Strengthening of the Crossing Lemma
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
Jacob Fox, János Pach, Csaba D. Tóth