Sciweavers

3229 search results - page 573 / 646
» The Theory of Timed Automata
Sort
View
ESWA
2006
122views more  ESWA 2006»
13 years 9 months ago
Ontology construction for information classification
Following the advent of the Internet technology and the rapid growth of its applications, users have spent long periods of time browsing through the ocean of information found in ...
Sung-Shun Weng, Hsine-Jen Tsai, Shang-Chia Liu, Ch...
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 9 months ago
Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
Maged Hamada Ibrahim
JCIT
2008
138views more  JCIT 2008»
13 years 9 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
JAR
2006
236views more  JAR 2006»
13 years 9 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
SIGCSE
2008
ACM
166views Education» more  SIGCSE 2008»
13 years 9 months ago
Defense against the dark arts
Computer science faculty must attract and retain students by offering innovative courses that spark student interest, yet still teach core, computer science concepts. These effort...
Mark W. Bailey, Clark L. Coleman, Jack W. Davidson