Sciweavers

13603 search results - page 222 / 2721
» On the Complexity of Computing Treelength
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
15 years 5 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ICPR
2008
IEEE
16 years 7 months ago
Semi-supervised learning on large complex simulations
Complex simulations can generate very large amounts of data stored disjointly across many local disks. Learning from this data can be problematic due to the difficulty of obtainin...
John Nicholas Korecki, Kevin W. Bowyer, Larry O. H...
ICPR
2006
IEEE
16 years 6 months ago
Unifying Background Models over Complex Audio using Entropy
In this paper we extend an existing audio background modelling technique, leading to a more robust application to complex audio environments. The determination of background audio...
Geoff A. W. West, Simon Moncrieff, Svetha Venkates...
ICALP
2009
Springer
16 years 6 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
SIBGRAPI
2005
IEEE
15 years 11 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...