Sciweavers

7006 search results - page 1322 / 1402
» Approximation Algorithms
Sort
View
114
Voted
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 27 days ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
WWW
2010
ACM
15 years 6 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 1 months ago
Evolutionary swarm design of architectural idea models
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
Sebastian von Mammen, Christian Jacob

Publication
254views
14 years 6 months ago
Z-fighting aware Depth Peeling
Efficient capturing of the entire topological and geometric information of a 3D scene is an important feature in many graphics applications for rendering multi-fragment effects. Ex...
Andreas Vasilakis and Ioannis Fudos
136
Voted
SIGCOMM
2012
ACM
13 years 3 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
« Prev « First page 1322 / 1402 Last » Next »