3545 search results - page 681 / 709 » Computational methods for case-cohort studies |
KDD
2003
ACM
16 years 5 days ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
182
click to vote
SIGMOD
2009
ACM
16 years 7 hour ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
188
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
127
click to vote
EDBT
2004
ACM
15 years 12 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
102
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
Wireless networks are built upon a shared medium that makes it easy for adversaries to launch jamming-style attacks. These attacks can be easily accomplished by an adversary emitt...