Sciweavers

7988 search results - page 1320 / 1598
» A Useful Undecidable Theory
Sort
View
CIKM
2010
Springer
15 years 5 months ago
Term necessity prediction
The probability that a term appears in relevant documents ( ) is a fundamental quantity in several probabilistic retrieval models, however it is difficult to estimate without rele...
Le Zhao, Jamie Callan
CORR
2010
Springer
205views Education» more  CORR 2010»
15 years 5 months ago
An Algorithm for Detection of Selfish Nodes in Wireless Mesh Networks
—Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the pot...
Jaydip Sen, Kaustav Goswami
DM
2008
77views more  DM 2008»
15 years 5 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
FSS
2010
107views more  FSS 2010»
15 years 5 months ago
Cut approach to islands in rectangular fuzzy relations
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...
Eszter K. Horváth, Branimir Seselja, Andrej...
IANDC
2010
68views more  IANDC 2010»
15 years 5 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
« Prev « First page 1320 / 1598 Last » Next »