Sciweavers

1941 search results - page 222 / 389
» On the Hardness of Approximate Reasoning
Sort
View
IJCSA
2006
289views more  IJCSA 2006»
15 years 6 months ago
Cash Forecasting: An Application of Artificial Neural Networks in Finance
Artificial Neural Networks are universal and highly flexible function approximators first used in the fields of cognitive science and engineering. In recent years, Neural Networks...
PremChand Kumar, Ekta Walia
IPL
2006
97views more  IPL 2006»
15 years 6 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
JMIV
2008
94views more  JMIV 2008»
15 years 6 months ago
Measuring Elongation from Shape Boundary
Abstract Shape elongation is one of the basic shape descriptors that has a very clear intuitive meaning. That is the reason for its applicability in many shape classification tasks...
Milos Stojmenovic, Jovisa D. Zunic
TCS
2008
15 years 6 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...
BMCBI
2005
88views more  BMCBI 2005»
15 years 6 months ago
Using large-scale perturbations in gene network reconstruction
Background: Recent analysis of the yeast gene network shows that most genes have few inputs, indicating that enumerative gene reconstruction methods are both useful and computatio...
Thomas MacCarthy, Andrew Pomiankowski, Robert Seym...