Sciweavers

6274 search results - page 1066 / 1255
» From query complexity to computational complexity
Sort
View
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
15 years 4 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
CCR
2002
111views more  CCR 2002»
15 years 4 months ago
A taxonomy and design considerations for Internet accounting
Economic principles are increasingly being suggested for addressing some complex issues related to distributed resource allocation for QoS (Quality of Service) enhancement. Many p...
Michel Kouadio, Udo W. Pooch
FUIN
2000
71views more  FUIN 2000»
15 years 4 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 4 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
ASE
1998
81views more  ASE 1998»
15 years 4 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
« Prev « First page 1066 / 1255 Last » Next »