Sciweavers

3146 search results - page 23 / 630
» Efficient Consequence Finding
Sort
View
CIE
2010
Springer
14 years 3 days ago
A Faster Algorithm for Finding Minimum Tucker Submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are centr...
Guillaume Blin, Romeo Rizzi, Stéphane Viale...
FLAIRS
2004
13 years 10 months ago
Finding Partners to Form Information Sharing Networks in Open Multi-Agent Systems
Information quality assurance despite the existence of uncertainty about sources can be investigated in the context of soft security where an agent maintains trustworthiness evalu...
K. Suzanne Barber, Jisun Park
CEC
2005
IEEE
14 years 2 months ago
Complementary selection and variation for an efficient multiobjective optimization of complex systems
Real-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more d...
Benoît Bagot, Hartmut Pohlheim
OSDI
2002
ACM
14 years 9 months ago
Resource Overbooking and Application Profiling in Shared Hosting Platforms
In this paper, we present techniques for provisioning CPU and network resources in shared hosting platforms running potentially antagonistic third-party applications. The primary ...
Bhuvan Urgaonkar, Prashant J. Shenoy, Timothy Rosc...
ECCV
2008
Springer
14 years 10 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar