Sciweavers

1538 search results - page 224 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
CAGD
2007
75views more  CAGD 2007»
15 years 1 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
CIKM
2009
Springer
15 years 8 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
15 years 3 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
CVPR
2007
IEEE
16 years 3 months ago
Topology matching for 3D video compression
This paper presents a new technique to reduce the storage cost of high quality 3D video. In 3D video [12], a sequence of 3D objects represents scenes in motion. Every frame is com...
Tony Tung, Francis Schmitt, Takashi Matsuyama
CIKM
2009
Springer
15 years 8 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...