Sciweavers

4526 search results - page 443 / 906
» Algorithmic problems related to the Internet
Sort
View
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
16 years 15 days ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
SPC
2005
Springer
16 years 11 days ago
On the Anonymity of Periodic Location Samples
As Global Positioning System (GPS) receivers become a common feature in cell phones, personal digital assistants, and automobiles, there is a growing interest in tracking larger us...
Marco Gruteser, Baik Hoh
HICSS
2003
IEEE
90views Biometrics» more  HICSS 2003»
16 years 5 days ago
A Prototype for Multiple Whole Genome Alignment
In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several pr...
Jitender S. Deogun, Fangrui Ma, Jingyi Yang, Andre...
DAGM
2006
Springer
15 years 10 months ago
Cross-Articulation Learning for Robust Detection of Pedestrians
Recognizing categories of articulated objects in real-world scenarios is a challenging problem for today's vision algorithms. Due to the large appearance changes and intra-cla...
Edgar Seemann, Bernt Schiele
SODA
2004
ACM
152views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
Artur Czumaj, Michelangelo Grigni, Papa Sissokho, ...