702 search results - page 41 / 141 » Identifying Graph Automorphisms Using Determining Sets |
FSTTCS
2008
Springer
15 years 26 days ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
118
click to vote
VISSYM
2003
15 years 1 months ago
2003
A high-level approach to describe the characteristics of a surface is to segment it into regions of uniform curehavior and construct an abstract representation given by a (topolog...
ECOOP
2006
Springer
15 years 3 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
103
click to vote
FSKD
2009
Springer
14 years 9 months ago
2009
Springer
Sense Induction is the process of identifying the word sense given its context, often treated as a clustering task. This paper explores the use of spectral cluster method which in...
SCAM
2003
IEEE
15 years 5 months ago
2003
IEEE
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...