Sciweavers

8083 search results - page 1374 / 1617
» A Formalization of Software Architecture
Sort
View
CICLING
2008
Springer
15 years 8 months ago
A Probabilistic Model for Guessing Base Forms of New Words by Analogy
Language software applications encounter new words, e.g., acronyms, technical terminology, loan words, names or compounds of such words. Looking at English, one might assume that t...
Krister Lindén
COORDINATION
2006
Springer
15 years 8 months ago
Enabling Ubiquitous Coordination Using Application Sessions
Abstract. Enabling coordination among ubiquitous computing applicad resources requires programming abstractions and development tools tailored to this unique environment. This pape...
Christine Julien, Drew Stovall
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
15 years 8 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
15 years 8 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
EUSFLAT
2007
152views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Object Oriented Approach in Fuzzy Arithmetic Using Parametric Representation of Fuzzy Numbers
Parametric representation of fuzzy numbers (PFN) with derived methods for performing fuzzy arithmetic proves to have better accuracy and similar computational speed to using trian...
Frantisek Hunka
« Prev « First page 1374 / 1617 Last » Next »