702 search results - page 107 / 141 » Identifying Graph Automorphisms Using Determining Sets |
101
click to vote
LREC
2008
15 years 1 months ago
2008
Ontology construction usually requires a domain-specific corpus for building corresponding concept hierarchy. The domain corpus must have a good coverage of domain knowledge. Wiki...
106
click to vote
BROADNETS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute th...
192
click to vote
POPL
2003
ACM
16 years 2 days ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
101
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Many algorithms have been developed for deciphering the tandem mass spectrometry (MS) data sets. They can be essentially clustered into two classes. The first performs...
108
click to vote
QEST
2006
IEEE
15 years 5 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...