Sciweavers

10988 search results - page 267 / 2198
» Algorithmic Folding Complexity
Sort
View
INFOVIS
2002
IEEE
15 years 9 months ago
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents ...
Alistair Morrison, Greg Ross, Matthew Chalmers
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
14 years 7 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
126
Voted
APSEC
2007
IEEE
15 years 10 months ago
Incentive Compatible Mechanisms for Group Ticket Allocation in Software Maintenance Services
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or m...
Karthik Subbian, Ramakrishnan Kannan, Raghav Kumar...
BMCBI
2004
123views more  BMCBI 2004»
15 years 4 months ago
Interaction profile-based protein classification of death domain
Background: The increasing number of protein sequences and 3D structure obtained from genomic initiatives is leading many of us to focus on proteomics, and to dedicate our experim...
Drew Lett, Michael Hsing, Frederic Pio
142
Voted
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 9 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang