Sciweavers

2254 search results - page 61 / 451
» Computing the minimal covering set
Sort
View
IPPS
1993
IEEE
14 years 2 months ago
"Unstable Threads" Kernel Interface for Minimizing the Overhead of Thread Switching
The performance of threads is limited primarily by the overhead of two kinds of switching: vertical switching (user/kernel domain switching) and horizontal switching (context swit...
Shigekazu Inohara, Kazuhiko Kato, Takashi Masuda
ACCV
2006
Springer
14 years 4 months ago
Minimal Weighted Local Variance as Edge Detector for Active Contour Models
Performing segmentation of narrow, elongated structures with low contrast boundaries is a challenging problem. Boundaries of these structures are difficult to be located when noise...
Max W. K. Law, Albert C. S. Chung
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 10 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
JUCS
2006
73views more  JUCS 2006»
13 years 10 months ago
Proving Properties for Behavioural Specifications with Term Observation
: Behavioural specifications allow to focus only on the"observable" behaviour of objects. These observations are made through "observable contexts" which are pa...
Narjes Berregeb
CVPR
2008
IEEE
14 years 12 months ago
Minimal solutions for generic imaging models
A generic imaging model refers to a non-parametric camera model where every camera is treated as a set of unconstrained projection rays. Calibration would simply be a method to ma...
Srikumar Ramalingam, Peter F. Sturm