Sciweavers

425 search results - page 44 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
ALENEX
2009
118views Algorithms» more  ALENEX 2009»
15 years 13 days ago
Solving Maximum Flow Problems on Real World Bipartite Graphs
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...
ICCV
2003
IEEE
16 years 1 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
ISCA
2006
IEEE
169views Hardware» more  ISCA 2006»
15 years 5 months ago
Balanced Cache: Reducing Conflict Misses of Direct-Mapped Caches
Level one cache normally resides on a processor’s critical path, which determines the clock frequency. Directmapped caches exhibit fast access time but poor hit rates compared w...
Chuanjun Zhang
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
14 years 11 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
ICASSP
2008
IEEE
15 years 5 months ago
Detecting mild cognitive loss with continuous monitoring of medication adherence
This paper describes an approach for detecting early cognitive loss using medication adherence behavior. We investigate the discriminative power of a comprehensive set of recurren...
Yonghong Huang, Deniz Erdogmus, Zhengdong Lu, Todd...