Sciweavers

780 search results - page 55 / 156
» Cost-Sharing Approximations for h
Sort
View
VISUALIZATION
1997
IEEE
14 years 2 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber
WWW
2011
ACM
13 years 4 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 10 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 4 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
ICALP
2007
Springer
14 years 4 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie