Sciweavers

522 search results - page 55 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
14 years 6 days ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
CONEXT
2008
ACM
13 years 9 months ago
Troubleshooting chronic conditions in large IP networks
Chronic network conditions are caused by performance impairing events that occur intermittently over an extended period of time. Such conditions can cause repeated performance deg...
Ajay Mahimkar, Jennifer Yates, Yin Zhang, Aman Sha...
AAAI
2004
13 years 9 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
MM
2010
ACM
200views Multimedia» more  MM 2010»
13 years 8 months ago
Multimodal location estimation
In this article we define a multimedia content analysis problem, which we call multimodal location estimation: Given a video/image/audio file, the task is to determine where it wa...
Gerald Friedland, Oriol Vinyals, Trevor Darrell
ML
1998
ACM
13 years 7 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...