Sciweavers

895 search results - page 129 / 179
» Using graphs for some discrete tomography problems
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 3 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
13 years 9 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
COCOA
2009
Springer
15 years 2 months ago
Variable-Size Rectangle Covering
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
AAAI
2007
15 years 11 days ago
Isometric Projection
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
Deng Cai, Xiaofei He, Jiawei Han