Sciweavers

537 search results - page 78 / 108
» A new upper bound for 3-SAT
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
COCOON
2006
Springer
14 years 6 days 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
TWC
2008
106views more  TWC 2008»
13 years 8 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
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...