Sciweavers

3044 search results - page 120 / 609
» Linear logical approximations
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 6 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
CONCUR
2010
Springer
13 years 10 months ago
Modal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
Cristian Prisacariu
LICS
2003
IEEE
14 years 2 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
JSAC
2007
63views more  JSAC 2007»
13 years 9 months ago
A new survivable mapping problem in IP-over-WDM networks
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
Chang Liu, Lu Ruan
ICPR
2004
IEEE
14 years 10 months ago
Historical Document Image Enhancement Using Background Light Intensity Normalization
This paper presents a new background light intensity normalization algorithm suitable for historical document images. The algorithm uses an adaptive linear function to approximate...
Venu Govindaraju, Zhixin Shi