Sciweavers

467 search results - page 46 / 94
» Roadmap of Infinite Results
Sort
View
ENTCS
2010
90views more  ENTCS 2010»
13 years 9 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
13 years 8 months ago
Tight Estimates for Eigenvalues of Regular Graphs
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
Alon Nilli
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 8 months ago
Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
James A. Sellers, Andrew V. Sills, Gary L. Mullen
ETELEMED
2009
IEEE
171views Healthcare» more  ETELEMED 2009»
14 years 3 months ago
Drivers and Challenges of Wireless Solutions in Future Healthcare
What do IT oriented healthcare people think to be most attractive and credible wireless applications in healthcare? What do they think about the challenges? These questions were p...
Esko Alasaarela, Ravi Nemana, Steven DeMello
TCAD
2008
114views more  TCAD 2008»
13 years 9 months ago
Test-Quality/Cost Optimization Using Output-Deviation-Based Reordering of Test Patterns
At-speed functional testing, delay testing, and n-detection test sets are being used today to detect deep submicrometer defects. However, the resulting test data volumes are too hi...
Zhanglei Wang, Krishnendu Chakrabarty