2877 search results - page 309 / 576 » The Complexity of Planarity Testing |
169
click to vote
CSREASAM
2008
15 years 8 months ago
2008
- We propose an authentication scheme resistant to eavesdropping attacks. Users select an alphanumeric password with a length of 9-15 symbols. They can use this password in the tra...
179
click to vote
EON
2008
15 years 8 months ago
2008
One of the arguments for choosing description logics as the basis for the Web Ontology Language is the ability to support the development of complex ontologies through logical reas...
216
Voted
FECS
2008
15 years 8 months ago
2008
Teaching software modeling and software design presents a different and difficult set of problems than teaching some of the other aspects of software engineering such as testing a...
145
click to vote
GEOINFO
2007
15 years 8 months ago
2007
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against...
134
click to vote
LREC
2008
15 years 8 months ago
2008
The Italian particle ne exhibits interesting anaphoric properties that have not been yet explored in depth from a corpus and computational linguistic perspective. We provide: (i) ...