Sciweavers

1061 search results - page 125 / 213
» Natural Selection in Relation to Complexity
Sort
View
ACL
1993
13 years 10 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
COLING
1992
13 years 10 months ago
Generating Coherent Argumentative Paragraphs
Q Should I take AI this semester? We address the problem of generating a coherent A If you want to take courses likeparagraph presenting arguments for a conclusion in a Natural La...
Michael Elhadad
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
AC
2000
Springer
14 years 1 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
BMCBI
2005
104views more  BMCBI 2005»
13 years 9 months ago
A statistical approach for array CGH data analysis
Background: Microarray-CGH experiments are used to detect and map chromosomal imbalances, by hybridizing targets of genomic DNA from a test and a reference sample to sequences imm...
Franck Picard, Stéphane Robin, Marc Laviell...