Sciweavers

38 search results - page 7 / 8
» An Upper Bound for Constrained Ramsey Numbers
Sort
View
72
Voted
HIPC
2004
Springer
15 years 2 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
CVPR
2000
IEEE
15 years 11 months ago
Layer Extraction from Multiple Images Containing Reflections and Transparency
Many natural images contain reflections and transparency, i.e., they contain mixtures of reflected and transmitted light. When viewed from a moving camera, these appear as the sup...
Richard Szeliski, Shai Avidan, P. Anandan
IJCM
2002
92views more  IJCM 2002»
14 years 9 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
ICCV
2005
IEEE
15 years 11 months ago
Quasiconvex Optimization for Robust Geometric Reconstruction
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
Qifa Ke, Takeo Kanade
LREC
2010
136views Education» more  LREC 2010»
14 years 11 months ago
Inter-sentential Relations in Information Extraction Corpora
In natural language relationships between entities can asserted within a single sentence or over many sentences in a document. Many information extraction systems are constrained ...
Kumutha Swampillai, Mark Stevenson