Sciweavers

5832 search results - page 393 / 1167
» Software complexity and maintainability
Sort
View
AAAI
2007
15 years 9 months ago
Ungreedy Methods for Chinese Deterministic Dependency Parsing
Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more comp...
Xiangyu Duan, Jun Zhao, Bo Xu
AAAI
2007
15 years 9 months ago
Biomind ArrayGenius and GeneGenius: Web Services Offering Microarray and SNP Data Analysis via Novel Machine Learning Methods
Analysis of postgenomic biological data (such as microarray and SNP data) is a subtle art and science, and the statistical methods most commonly utilized sometimes prove inadequat...
Ben Goertzel, Cassio Pennachin, Lúcio de So...
NSDI
2004
15 years 8 months ago
Path-Based Failure and Evolution Management
We present a new approach to managing failures and evolution in large, complex distributed systems using runtime paths. We use the paths that requests follow as e through the syst...
Mike Y. Chen, Anthony Accardi, Emre Kiciman, David...
PR
2008
90views more  PR 2008»
15 years 6 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 6 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye