Sciweavers

7351 search results - page 1391 / 1471
» Segmenting Point Sets
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 8 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
ICALP
2009
Springer
14 years 8 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 7 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
14 years 7 months ago
DADA: a data cube for dominant relationship analysis
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
Cuiping Li, Beng Chin Ooi, Anthony K. H. Tung, Sha...
EDBT
2002
ACM
120views Database» more  EDBT 2002»
14 years 7 months ago
Hyperdatabases: Infrastructure for the Information Space
The amount of stored information is exploding while, at the same time, tools for accessing relevant information are rather under-developed. Usually, all users have a pre-defined vi...
Hans-Jörg Schek
« Prev « First page 1391 / 1471 Last » Next »