Sciweavers

2661 search results - page 199 / 533
» Quantum Complexity Classes
Sort
View
110
Voted
COGSCI
2004
108views more  COGSCI 2004»
15 years 3 months ago
Making the ineffable explicit: estimating the information employed for face classifications
When we look at a face, we readily perceive that person's gender, expression, identity, age, and attractiveness. Perceivers as well as scientists have hitherto had little suc...
Michael C. Mangini, Irving Biederma
144
Voted
TNN
2010
127views Management» more  TNN 2010»
14 years 10 months ago
RAMOBoost: ranked minority oversampling in boosting
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...
Sheng Chen, Haibo He, Edwardo A. Garcia
104
Voted
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
16 years 3 months ago
Beyond NP: the work and legacy of Larry Stockmeyer
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
Lance Fortnow
PODS
2006
ACM
121views Database» more  PODS 2006»
16 years 3 months ago
On the efficiency of checking perfect privacy
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
Ashwin Machanavajjhala, Johannes Gehrke
110
Voted
COCOON
2009
Springer
15 years 10 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura