6251 search results - page 96 / 1251 » Randomness, Computability, and Density |
110
click to vote
CAMP
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
87
Voted
IEEESCC
2006
IEEE
15 years 6 months ago
2006
IEEE
The expanding gap between microprocessor and disk performance has initiated new techniques of providing memory as a service in high-end computing (HEC). Although the processor and...
108
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
101
Voted
JUCS
2007
15 years 17 days ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
113
Voted
ICFCA
2009
Springer
15 years 5 months ago
2009
Springer
This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main id...