Sciweavers

477 search results - page 77 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
PLDI
2003
ACM
14 years 1 months ago
Static array storage optimization in MATLAB
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
Pramod G. Joisha, Prithviraj Banerjee
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 1 months ago
A viewpoint-based approach for interaction graph analysis
Recent innovations have resulted in a plethora of social applications on the Web, such as blogs, social networks, and community photo and video sharing applications. Such applicat...
Sitaram Asur, Srinivasan Parthasarathy
INFOCOM
2007
IEEE
14 years 2 months ago
Small Active Counters
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
Rade Stanojevic
IAW
2003
IEEE
14 years 1 months ago
Assuring Consistency and Increasing Reliability in Group Communication Mechanisms in Computational Resiliency
— The Computational Resiliency library (CRLib) provides distributed systems with the ability to sustain operation and dynamically restore the level of assurance in system functio...
Norka B. Lucena, Steve J. Chapin, Joohan Lee