Sciweavers

14518 search results - page 2544 / 2904
» Two Problems for Sophistication
Sort
View
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
16 years 7 months ago
Address Code and Arithmetic Optimizations for Embedded Systems
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
J. Ramanujam, Satish Krishnamurthy, Jinpyo Hong, M...
CHI
2002
ACM
16 years 7 months ago
Direct manipulation interface for architectural design tools
The early architectural design stage is a typical example where traditional design tools such as sketching on paper still dominate over computer-assisted tools. Augmented reality ...
Dzmitry Aliakseyeu
RECOMB
2006
Springer
16 years 7 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
RECOMB
2005
Springer
16 years 7 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 7 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
« Prev « First page 2544 / 2904 Last » Next »