Sciweavers

3359 search results - page 9 / 672
» A Simplified Idea Algorithm
Sort
View
IJCGA
2008
114views more  IJCGA 2008»
13 years 7 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
COORDINATION
2008
Springer
13 years 9 months ago
How to Infer Finite Session Types in a Calculus of Services and Sessions
Abstract. The notion of session is fundamental in service oriented applications, as it separates interactions between different instances of the same service, and it groups togethe...
Leonardo Gaetano Mezzina
ENTCS
2002
71views more  ENTCS 2002»
13 years 7 months ago
A Simplified Account of the Metatheory of Linear LF
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
Joseph Vanderwaart, Karl Crary
ACCV
2007
Springer
13 years 11 months ago
Motion Observability Analysis of the Simplified Color Correlogram for Visual Tracking
Abstract. Compared with the color histogram, where the position information of each pixel is ignored, a simplified color correlogram (SCC) representation encodes the spatial inform...
Qi Zhao, Hai Tao
ECCC
2000
101views more  ECCC 2000»
13 years 7 months ago
Simplified derandomization of BPP using a hitting set generator
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
Oded Goldreich, Salil P. Vadhan, Avi Wigderson