Sciweavers

112 search results - page 21 / 23
» Generalized View-Dependent Simplification
Sort
View
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
ICSE
2008
IEEE-ACM
14 years 8 months ago
DySy: dynamic symbolic execution for invariant inference
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
Christoph Csallner, Nikolai Tillmann, Yannis Smara...
WWW
2008
ACM
14 years 8 months ago
Service-oriented data denormalization for scalable web applications
Many techniques have been proposed to scale web applications. However, the data interdependencies between the database queries and transactions issued by the applications limit th...
Zhou Wei, Dejun Jiang, Guillaume Pierre, Chi-Hung ...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
14 years 8 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...