Sciweavers

394 search results - page 56 / 79
» Expected Case for Projecting Points
Sort
View
91
Voted
JOT
2008
108views more  JOT 2008»
14 years 9 months ago
Requirements analysis for large scale systems
All readers of this paper most likely have knowledge of the software requirements discipline and of the use case notation, however not everyone is aware that with the progress of ...
Roger Johnson, George Roussos, Luca Vetti Tagliati
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
15 years 9 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
158
Voted
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
15 years 9 months ago
Angle-based space partitioning for efficient parallel skyline computation
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
ISSTA
2007
ACM
14 years 11 months ago
Instrumenting where it hurts: an automatic concurrent debugging technique
As concurrent and distributive applications are becoming more common and debugging such applications is very difficult, practical tools for automatic debugging of concurrent appl...
Rachel Tzoref, Shmuel Ur, Elad Yom-Tov
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe