2104 search results - page 186 / 421 » Sorting with networks of data structures |
154
Voted
UAI
2000
15 years 6 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
263
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
137
click to vote
FCT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
141
Voted
SAC
2005
ACM
15 years 10 months ago
2005
ACM
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
139
click to vote
AVI
2006
15 years 6 months ago
2006
During grouping tasks for data exploration and sense-making, the criteria are normally not well-defined. When users are bringing together data objects thought to be similar in som...