Sciweavers

1485 search results - page 48 / 297
» connection 2010
Sort
View
LATIN
2010
Springer
14 years 4 months ago
Some Observations on Holographic Algorithms
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
Leslie G. Valiant
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
14 years 2 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
EJC
2010
13 years 10 months ago
The flipping puzzle on a graph
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
Hau-wen Huang, Chih-wen Weng
FORMATS
2010
Springer
13 years 8 months ago
From Mtl to Deterministic Timed Automata
Abstract. In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-variability assumptions. We handle fu...
Dejan Nickovic, Nir Piterman
TMA
2010
Springer
148views Management» more  TMA 2010»
13 years 7 months ago
TCP Traffic Classification Using Markov Models
This paper presents a novel traffic classification approach which classifies TCP connections with help of observable Markov models. As traffic properties, payload length, direction...
Gerhard Münz, Hui Dai, Lothar Braun, Georg Ca...