Sciweavers

4860 search results - page 211 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 10 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 7 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
GLOBECOM
2008
IEEE
14 years 5 months ago
Low-Complexity Hybrid QRD-MCMC MIMO Detection
In this paper, we propose a novel hybrid QRD-MCMC MIMO detector that combines the feature of a QRD-M detector and a Markov chain Monte Carlo (MCMC) detector. The QRD-M algorithm i...
Ronghui Peng, Koon Hoo Teo, Jinyun Zhang, Rong-Ron...
DOCENG
2003
ACM
14 years 3 months ago
Using SVG as the rendering model for structured and graphically complex web material
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
Julius C. Mong, David F. Brailsford
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 3 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain