Sciweavers

4325 search results - page 172 / 865
» Incremental computation with names
Sort
View
IAJIT
2010
99views more  IAJIT 2010»
15 years 5 months ago
Hybrid computing algorithm in representing solid model
: This paper presents an algorithm, which is a hybrid-computing algorithm in representing solid model. The proposed algorithm contains two steps namely reconstruction and represent...
Muhammad Matondang, Habibollah Haron
PERCOM
2004
ACM
16 years 6 months ago
Patch Panel: Enabling Control-Flow Interoperability in Ubicomp Environments
Ubiquitous computing environments accrete slowly over time rather than springing into existence all at once. Mechanisms are needed for incremental integration-the problem of how t...
Rafael Ballagas, Andy Szybalski, Armando Fox
COMPGEOM
1994
ACM
15 years 10 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...
JSCIC
2006
98views more  JSCIC 2006»
15 years 6 months ago
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
Sigal Gottlieb, Steven J. Ruuth
PVLDB
2010
84views more  PVLDB 2010»
15 years 4 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...