Sciweavers

2340 search results - page 193 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
AOSD
2005
ACM
16 years 1 days ago
Modularizing design patterns with aspects: a quantitative study
Design patterns offer flexible solutions to common problems in software development. Recent studies have shown that several design patterns involve crosscutting concerns. Unfortun...
Alessandro F. Garcia, Cláudio Sant'Anna, Ed...
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 7 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 7 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
COMPGEOM
2008
ACM
15 years 8 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
SIGIR
2008
ACM
15 years 6 months ago
Learning from labeled features using generalized expectation criteria
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
Gregory Druck, Gideon S. Mann, Andrew McCallum