Sciweavers

3946 search results - page 704 / 790
» The computational complexity of choice sets
Sort
View
SIGMOD
1996
ACM
99views Database» more  SIGMOD 1996»
15 years 10 months ago
A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
Leonid Libkin, Rona Machlin, Limsoon Wong
ESORICS
2007
Springer
15 years 10 months ago
Satisfiability and Resiliency in Workflow Systems
We propose the role-and-relation-based access control (R2 BAC) model for workflow systems. In R2 BAC, in addition to a user's role memberships, the user's relationships w...
Qihua Wang, Ninghui Li
NIPS
2001
15 years 7 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
BMCBI
2010
183views more  BMCBI 2010»
15 years 6 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
BMCBI
2010
142views more  BMCBI 2010»
15 years 6 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...