Sciweavers

543 search results - page 79 / 109
» New Upper Bounds for MaxSat
Sort
View
COCOON
2006
Springer
15 years 1 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
76
Voted
TWC
2008
106views more  TWC 2008»
14 years 9 months ago
Spatial Multiplexing Architectures with Jointly Designed Rate-Tailoring and Ordered BLAST Decoding - Part I: Diversity-Multiplex
Abstract-- The V-BLAST (vertical Bell Labs layered Space-Time) architecture involves independent coding/decoding per antenna (layer) with equal rate and power per antenna and a fix...
Yi Jiang, Mahesh K. Varanasi
ICS
2010
Tsinghua U.
15 years 7 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
90
Voted
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
15 years 6 months ago
Code Placement with Selective Cache Activity Minimization for Embedded Real-time Software Design
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
Junhyung Um, Taewhan Kim
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
15 years 4 months ago
H-LLL: using householder inside LLL
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
Ivan Morel, Damien Stehlé, Gilles Villard