Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
16616
search results - page 343 / 3324
»
Extending Extended Vacuity
Sort
relevance
views
votes
recent
update
View
thumb
title
139
click to vote
CSDA
2006
149
views
more
CSDA 2006
»
Bayesian sigmoid shrinkage with improper variance priors and an application to wavelet denoising
15 years 6 months ago
Download
www.biometris.wur.nl
The normal Bayesian linear model is extended by assigning a flat prior to the th power of the variance components of the regression coefficients (0<
Cajo J. F. ter Braak
claim paper
Read More »
181
click to vote
ENTCS
2006
142
views
more
ENTCS 2006
»
Predicate Diagrams for the Verification of Real-Time Systems
15 years 6 months ago
Download
hal.inria.fr
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
Eun-Young Kang, Stephan Merz
claim paper
Read More »
149
click to vote
IJFCS
2008
58
views
more
IJFCS 2008
»
Remarks on Two Nonstandard Versions of Periodicity in Words
15 years 6 months ago
Download
www.uncg.edu
In this paper, we study some periodicity concepts on words. First, we extend the notion of full tilings which was recently introduced by Karhum
Francine Blanchet-Sadri, L. Bromberg, K. Zipple
claim paper
Read More »
128
click to vote
COMBINATORICS
2007
87
views
more
COMBINATORICS 2007
»
Recognizing Cluster Algebras of Finite Type
15 years 6 months ago
Download
www.univie.ac.at
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
Ahmet I. Seven
claim paper
Read More »
141
click to vote
JDA
2008
67
views
more
JDA 2008
»
On minimum k-modal partitions of permutations
15 years 6 months ago
Download
www.math.tu-berlin.de
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...
claim paper
Read More »
« Prev
« First
page 343 / 3324
Last »
Next »