Sciweavers

328 search results - page 2 / 66
» Simple Termination Revisited
Sort
View
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 4 months ago
BrlAPI: Simple, Portable, Concurrent, Application-level Control of Braille Terminals
Screen readers can drive braille devices for allowing visually impaired users to access computer environments, by providing them the same information as sighted users. But in some...
Samuel Thibault, Sébastien Hinderer
WOWMOM
2005
ACM
112views Multimedia» more  WOWMOM 2005»
13 years 10 months ago
Revisit of RTS/CTS Exchange in High-Speed IEEE 802.11 Networks
IEEE 802.11 Medium Access Control (MAC) called Distributed Coordination Function (DCF) provides two different access modes, namely, 2-way (basic access) and 4-way (RTS/CTS) hands...
Ilenia Tinnirello, Sunghyun Choi, Youngsoo Kim
WPES
2006
ACM
13 years 11 months ago
Revisiting the uniqueness of simple demographics in the US population
According to a famous study [10] of the 1990 census data, 87% of the US population can be uniquely identified by gender, ZIP code and full date of birth. This short paper revisit...
Philippe Golle
LPAR
2007
Springer
13 years 11 months ago
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin
MFCS
2010
Springer
13 years 3 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen