Sciweavers

420 search results - page 62 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
DBWORKSHOPS
1992
14 years 11 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
COMPGEOM
2006
ACM
15 years 3 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
JACM
2006
99views more  JACM 2006»
14 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
CCS
2006
ACM
15 years 1 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang
ACL
2010
14 years 7 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler