Sciweavers

425 search results - page 34 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
CN
2000
126views more  CN 2000»
14 years 9 months ago
Cartesian routing
The dominant backbone protocol implemented in the Internet is the Border Gateway Protocol (BGP). Each router implementing BGP maintains a routing table. As networks increase in si...
Larry Hughes, Omid Banyasad, Evan J. Hughes
117
Voted
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 1 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
ISNN
2011
Springer
14 years 12 days ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
ICDE
2010
IEEE
874views Database» more  ICDE 2010»
15 years 9 months ago
UV-Diagram: A Voronoi Diagram for Uncertain Data
The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. In this paper, we study how the Voronoi diagram can be used on uncertain...
Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Ch...
RECOMB
2002
Springer
15 years 9 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin