Sciweavers

2131 search results - page 90 / 427
» Immunity for Closed Sets
Sort
View
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
14 years 11 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille
ACL
2010
14 years 11 months ago
Simultaneous Tokenization and Part-Of-Speech Tagging for Arabic without a Morphological Analyzer
We describe an approach to simultaneous tokenization and part-of-speech tagging that is based on separating the closed and open-class items, and focusing on the likelihood of the ...
Seth Kulick
JCSS
2011
107views more  JCSS 2011»
14 years 8 months ago
The isomorphism conjecture for constant depth reductions
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are i...
Manindra Agrawal
119
Voted
FSTTCS
2005
Springer
15 years 6 months ago
Causal Closure for MSC Languages
Abstract. Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing...
Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, V...
102
Voted
SIGGRAPH
2010
ACM
15 years 5 months ago
Triangle surfaces with discrete equivalence classes
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
Mayank Singh, Scott Schaefer