Sciweavers

254 search results - page 28 / 51
» Deterministic Soliton Graphs
Sort
View
ENTCS
2010
133views more  ENTCS 2010»
14 years 9 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
ICCV
2005
IEEE
15 years 3 months ago
Perceptual Scale Space and its Applications
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
Yizhou Wang, Siavosh Bahrami, Song Chun Zhu
73
Voted
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
15 years 4 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
P2P
2007
IEEE
104views Communications» more  P2P 2007»
15 years 3 months ago
How stable are large superpeer networks against attack?
In this paper, we analyze the stability of large scale superpeer networks against attacks. Two different kinds of attacks namely deterministic and degree dependent attack have bee...
Bivas Mitra, Sujoy Ghose, Niloy Ganguly
WADS
2005
Springer
108views Algorithms» more  WADS 2005»
15 years 3 months ago
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Nie...