Sciweavers

2496 search results - page 160 / 500
» On covering by translates of a set
Sort
View
ICCAD
2006
IEEE
141views Hardware» more  ICCAD 2006»
16 years 3 months ago
Algorithms for MIS vector generation and pruning
Ignoring the effect of simultaneous switching for logic gates causes silicon failures for high performance microprocessor designs. The main reason to omit this effect is the run...
Kenneth S. Stevens, Florentin Dartu
EDBT
2009
ACM
127views Database» more  EDBT 2009»
16 years 1 months ago
Answering aggregate keyword queries on relational databases using minimal group-bys
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
Bin Zhou 0002, Jian Pei
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
15 years 6 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter
INFSOF
2008
85views more  INFSOF 2008»
15 years 6 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
SASO
2007
IEEE
16 years 24 days ago
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer Computing
This paper describes, and evaluates benefits of, a design methodology to translate certain mathematical models into the design of novel, self-adaptive, peer-to-peer (p2p) distrib...
Steven Y. Ko, Indranil Gupta, Yookyung Jo