182 search results - page 11 / 37 » Approximate Colored Range Queries |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
166
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
138
Voted
AAMAS
2011
Springer
14 years 4 months ago
2011
Springer
We study the case where agents have preferences over ranges (intervals) of values, and we wish to elicit and aggregate these preferences. For example, consider a set of climatologi...
135
click to vote
CGI
2009
IEEE
15 years 1 months ago
2009
IEEE
We present an approach to automatically register a large set of color images to a 3D geometric model. The problem arises from the modeling of real-world environments, where surfac...
125
click to vote
DCG
2010
14 years 9 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...